On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0

DOI10.1007/978-1-4614-0769-0_25zbMath1334.90117OpenAlexW1516536271MaRDI QIDQ2802544

Reha H. Tütüncü, Kim-Chuan Toh, Michael J. Todd

Publication date: 26 April 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/15133

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20) Linear programming (90C05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Integrated inventory control and facility location decisions in a multi-echelon supply chain network with hubs, Solving symmetric and positive definite second-order cone linear complementarity problem by a rational Krylov subspace method, Local saddle points for unconstrained polynomial optimization, A line search penalty-free method for nonlinear second-order cone programming, Linear Programming Relaxations of Quadratically Constrained Quadratic Programs, Reliable approximations of probability-constrained stochastic linear-quadratic control, Regularized robust optimization: the optimal portfolio execution case, A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence, An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, On well-structured convex–concave saddle point problems and variational inequalities with monotone operators, Gradient methods and conic least-squares problems, Semidefinite programming hierarchies for constrained bilinear optimization, Status determination by interior-point methods for convex optimization problems in domain-driven form, A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem, A smoothing Newton method for the second-order cone complementarity problem., An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming, An SOS-QE approach to nonlinear gain analysis for polynomial dynamical systems, Generating irreducible copositive matrices using the stable set problem, Reference tracking stochastic model predictive control over unreliable channels and bounded control actions, Sparse solutions to random standard quadratic optimization problems, Certificates of infeasibility via nonsmooth optimization, Alternating projections on nontangential manifolds, First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems, Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools, Stochastic predictive control under intermittent observations and unreliable actions, A primal-dual interior-point method based on various selections of displacement step for symmetric optimization, An inexact interior-point Lagrangian decomposition algorithm with inexact oracles, Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates, A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones, Tridiagonal maximum-entropy sampling and tridiagonal masks, A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems, Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions, A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems, Dissipative stabilization of linear systems with time-varying general distributed delays, Revisiting several problems and algorithms in continuous location with $\ell _\tau $ norms, Outlier detection and least trimmed squares approximation using semi-definite programming, Robust trade-off portfolio selection, S<i>l</i><sub>1</sub>QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems, Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression, Efficient Solution of Maximum-Entropy Sampling Problems, A multilevel analysis of the Lasserre hierarchy, Convex optimisation-based methods for K-complex detection, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, Composite convex optimization with global and local inexact oracles, A robust bank asset allocation model integrating credit-rating migration risk and capital adequacy ratio regulations, Sparse and constrained stochastic predictive control for networked systems, Interpreting latent variables in factor models via convex optimization, Robust two-stage stochastic linear optimization with risk aversion, Interior Point Methods for Nonlinear Optimization, Maximum-entropy sampling and the Boolean quadric polytope, Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers, A fast nonlinear control method for linear systems with input saturation, Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence, Convex relaxations for mixed integer predictive control, A survey on conic relaxations of optimal power flow problem, Coprime factors reduction methods for linear parameter varying and uncertain systems, Robust high-order repetitive control: Optimal performance trade-offs, Mixing convex-optimization bounds for maximum-entropy sampling, A line search exact penalty method for nonlinear semidefinite programming, A new method based on the manifold-alternative approximating for low-rank matrix completion, Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms, Minimum variance constrained estimator, Solving SDP completely with an interior point oracle, Generalized self-concordant functions: a recipe for Newton-type methods, A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem, Successive linearization methods for nonlinear semidefinite programs

Uses Software

Cites Work