The following pages link to (Q4324980):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- Speed scaling for maximum lateness (Q255271) (← links)
- Randomized interior point methods for sampling and optimization (Q259600) (← links)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Generalized Gauss inequalities via semidefinite programming (Q263197) (← links)
- Optimal exponential synchronization of general chaotic delayed neural networks: an LMI approach (Q280401) (← links)
- On the construction of general cubature formula by flat extensions (Q281965) (← links)
- Robust adaptive attenuation of unknown periodic disturbances in uncertain multi-input multi-output systems (Q290820) (← links)
- Douglas-Rachford splitting method for semidefinite programming (Q295495) (← links)
- Random sampling: billiard walk algorithm (Q296789) (← links)
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (Q297833) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Decomposition-based interior point methods for stochastic quadratic second-order cone programming (Q298535) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs (Q304224) (← links)
- A linear-time algorithm for trust region problems (Q304248) (← links)
- Methods for minimax estimation under elementwise covariance uncertainty (Q315153) (← links)
- Derivatives of eigenvalues and Jordan frames (Q317127) (← links)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- Continuous multifacility ordered median location problems (Q322399) (← links)
- Synchronization of delayed neural networks with Lévy noise and Markovian switching via sampled data (Q328939) (← links)
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- Logarithmically homogeneous preferences (Q343110) (← links)
- Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional (Q350070) (← links)
- A trust region method for solving semidefinite programs (Q354640) (← links)
- A novel LMI-based optimization algorithm for the guaranteed estimation of the domain of attraction using rational Lyapunov functions (Q357969) (← links)
- Central swaths (Q358633) (← links)
- Gradient methods for minimizing composite functions (Q359630) (← links)
- A homotopy method for nonlinear semidefinite programming (Q360377) (← links)
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723) (← links)
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- On the \(\infty\)-norm of the cubic form of complete hyperbolic affine hyperspheres (Q370811) (← links)
- Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
- Minimization of project time and cost under constrained reliability index in the disjunctive project model (Q384696) (← links)
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- Enumeration approach to computing chemical equilibria (Q391182) (← links)
- Domain adaptation and sample bias correction theory and algorithm for regression (Q391745) (← links)
- A class of robust bounded controllers tracking a nonlinear discrete-time stochastic system: attractive ellipsoid technique application (Q397722) (← links)
- CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
- Robust formulations for clustering-based large-scale classification (Q402195) (← links)
- Subgradient methods for huge-scale optimization problems (Q403646) (← links)
- On the stable solution of large scale problems over the doubly nonnegative cone (Q403648) (← links)
- Approximate level method for nonsmooth convex minimization (Q415377) (← links)
- Computation of channel capacity based on self-concordant functions (Q415822) (← links)
- Strict anisotropic norm bounded real lemma in terms of matrix inequalities (Q416902) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
