Semidefinite Programming

DOI10.1137/1038003zbMath0845.65023OpenAlexW2912522929WikidataQ84355342 ScholiaQ84355342MaRDI QIDQ4877532

Lieven Vandenberghe, Stephen P. Boyd

Publication date: 9 September 1996

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1038003

zbMATH Keywords

convex optimizationsemidefinite programmingcombinatorial optimizationprimal-dual interior-point methodssurvey article

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (only showing first 100 items - show all)

Data dissemination and disclosure limitation in a world without microdata: a risk-utility framework for remote access analysis servers ⋮ Inverse conic linear programs in Banach spaces ⋮ Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data ⋮ State and unknown input estimation for discrete time multiple model ⋮ Stability of quadratic modules ⋮ Inverse scattering experiments, structured matrix inequalities, and tensor algebra ⋮ Inversion error, condition number, and approximate inverses of uncertain matrices ⋮ Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming ⋮ The algebraic degree of semidefinite programming ⋮ Parameter estimation for moving averages with positive innovations ⋮ LMI approach to robust model predictive control ⋮ Potential-reduction methods in mathematical programming ⋮ \(H_ \infty\) control for descriptor systems: A matrix inequalities approach ⋮ Initialization in semidefinite programming via a self-dual skew-symmetric embedding ⋮ Semidefinite programming in combinatorial optimization ⋮ Stochastic semidefinite programming: a new paradigm for stochastic optimization ⋮ Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals ⋮ Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling ⋮ Properties of the augmented Lagrangian in nonlinear semidefinite optimization ⋮ Optimal scaling of a gradient method for distributed resource allocation ⋮ On KKT points of homogeneous programs ⋮ A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines ⋮ Semidefinite bounds for the stability number of a graph via sums of squares of polynomials ⋮ On approximating complex quadratic optimization problems via semidefinite programming relaxations ⋮ Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs ⋮ Applications of second-order cone programming ⋮ A Newton-like method for solving rank constrained linear matrix inequalities ⋮ Optimal design and verification of temporal and spatial filters using second-order cone programming approach ⋮ Penalty and barrier methods for convex semidefinite programming ⋮ SOS approximations of nonnegative polynomials via simple high degree perturbations ⋮ Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case ⋮ A linear-quadratic optimal control problem for mean-field stochastic differential equations in infinite horizon ⋮ A perspective-based convex relaxation for switched-affine optimal control ⋮ The \(H\)-differentiability and calmness of circular cone functions ⋮ Elliptic and hyperbolic quadratic eigenvalue problems and associated distance problems. ⋮ Spectral methods for graph bisection problems. ⋮ Semidefinite programming and matrix scaling over the semidefinite cone. ⋮ Generalized semi-infinite programming: a tutorial ⋮ Uniform LP duality for semidefinite and semi-infinite programming ⋮ Exact relaxations of non-convex variational problems ⋮ Feature extraction using constrained maximum variance mapping ⋮ Reduced vertex set result for interval semidefinite optimization problems ⋮ Optimization of structural topology in the high-porosity regime ⋮ Approximating optimization problems over convex functions ⋮ Largest dual ellipsoids inscribed in dual cones ⋮ Set-membership filtering for systems with sensor saturation ⋮ On semidefinite representations of non-closed sets ⋮ Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods ⋮ Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities ⋮ Positive semidefinite quadratic forms on unitary matrices ⋮ Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ Feasibility and solvability of Lyapunov-type linear programming over symmetric cones ⋮ Certificates of convexity for basic semi-algebraic sets ⋮ Image space analysis for vector variational inequalities with matrix inequality constraints and applications ⋮ A primal-dual interior point method for nonlinear semidefinite programming ⋮ A convex polynomial that is not sos-convex ⋮ Semidefinite optimization in discrepancy theory ⋮ Quantum convex support ⋮ Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints ⋮ Faithful squashed entanglement ⋮ Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs ⋮ Lower-order penalization approach to nonlinear semidefinite programming ⋮ Finding positive matrices subject to linear restrictions ⋮ Antagonistic control ⋮ Parameter estimation with expected and residual-at-risk criteria ⋮ Estimation of the disturbance structure from data using semidefinite programming and optimal weighting ⋮ Handwritten chinese text line segmentation by clustering with distance metric learning ⋮ A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization ⋮ Bounds for codes by semidefinite programming ⋮ Characterizing the universal rigidity of generic frameworks ⋮ Space tensor conic programming ⋮ Wireless capacity with arbitrary gain matrix ⋮ Interval predictor models: identification and reliability ⋮ Positive semidefinite rank ⋮ Duality gap of the conic convex constrained optimization problems in normed spaces ⋮ Smaller SDP for SOS decomposition ⋮ A new primal-dual path-following interior-point algorithm for semidefinite optimization ⋮ A nonlinear optimization methodology for VLSI fixed-outline floorplanning ⋮ Performance bounds for linear stochastic control ⋮ Minimization of the effect of noisy measurements on localization of multi-agent autonomous formations ⋮ Superlinear convergence of interior-point algorithms for semidefinite programming ⋮ Numerical approaches for collaborative data processing ⋮ Semidefinite characterization and computation of zero-dimensional real radical ideals ⋮ Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming ⋮ The complexity of relating quantum channels to master equations ⋮ Polynomial chaos representation of spatio-temporal random fields from experimental measurements ⋮ A generalized flat extension theorem for moment matrices ⋮ Robust stability and performance analysis of uncertain systems using linear matrix inequalities ⋮ Construction of a class of sharp Löwner majorants for a set of symmetric matrices ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ On parametric semidefinite programming ⋮ Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions ⋮ Polynomial primal-dual cone affine scaling for semidefinite programming ⋮ Symmetric primal-dual path-following algorithms for semidefinite programming ⋮ Applications of semidefinite programming ⋮ On filter-successive linearization methods for nonlinear semidefinite programming ⋮ Large margin nearest local mean classifier ⋮ A long-step primal-dual path-following method for semidefinite programming

Uses Software

• LSQR

This page was built for publication: Semidefinite Programming