A primal-dual potential reduction method for problems involving matrix inequalities

DOI10.1007/BF01585558zbMath0857.90104OpenAlexW2168204766MaRDI QIDQ1922696

Lieven Vandenberghe, Stephen P. Boyd

Publication date: 11 March 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585558

zbMATH Keywords

semidefinite programmingmatrix inequalitiesinterior-point methodsworst-case analysispotential reduction method

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (37)

Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras ⋮ Robust performance of linear parametrically varying systems using parametrically-dependent linear feedback ⋮ A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis ⋮ GMRES-Accelerated ADMM for Quadratic Objectives ⋮ Explicit solutions for interval semidefinite linear programs ⋮ Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs ⋮ Explicit controller formulas for LMI-based \(H_ \infty\) synthesis ⋮ Low-order control design for LMI problems using alternating projection methods ⋮ Duality and basis functions for robust \({\mathcal H}_2\)-performance analysis ⋮ An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming ⋮ Matrix-Free Convex Optimization Modeling ⋮ Indefinite stochastic LQ control with cross term via semidefinite programming ⋮ A team algorithm for robust stability analysis and control design of uncertain time-varying linear systems using piecewise quadratic Lyapunov functions ⋮ Checking dissipativity of linear behavior systems given in kernel representation ⋮ A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization ⋮ Robust constrained model predictive control using linear matrix inequalities ⋮ An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization ⋮ LPV systems with parameter-varying time delays: Analysis and control ⋮ Improved smoothing Newton methods for symmetric cone complementarity problems ⋮ Complementarity properties of the Lyapunov transformation over symmetric cones ⋮ The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems ⋮ An algorithm to analyze stability of gene-expression patterns ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Semi-definite programming and quantum information ⋮ A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization ⋮ Method of centers for minimizing generalized eigenvalues ⋮ A one-parametric class of merit functions for the symmetric cone complementarity problem ⋮ A primal-dual interior-point algorithm with arc-search for semidefinite programming ⋮ A unified approach to LMI-based reduced order self-scheduling control synthesis ⋮ Growth behavior of two classes of merit functions for symmetric cone complementarity problems ⋮ Bregman primal-dual first-order method and application to sparse semidefinite programming ⋮ Robust stability and performance analysis of uncertain systems using linear matrix inequalities ⋮ A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming ⋮ Affine scaling algorithm fails for semidefinite programming ⋮ Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions ⋮ Symmetric primal-dual path-following algorithms for semidefinite programming ⋮ A long-step primal-dual path-following method for semidefinite programming

Uses Software

• RICPAC
• CRAIG
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Feasibility issues in a primal-dual interior-point method for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A relaxed version of Karmarkar's method
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A combined phase I-phase II scaled potential algorithm for linear programming
• A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
• Geometric algorithms and combinatorial optimization
• Method of centers for minimizing generalized eigenvalues
• An implementation of Karmarkar's algorithm for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
• Semi-Definite Matrix Constraints in Optimization
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
• A Hessenberg-Schur method for the problem AX + XB= C
• A Nonlinear Programming Problem in Statistics (Educational Testing)
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Path-Following Methods for Linear Programming
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• Large-Scale Optimization of Eigenvalues
• An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
• Algorithms for Minimum Trace Factor Analysis
• Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
• Potential Reduction Polynomial Time Method for Truss Topology Design
• Linear Matrix Inequalities in System and Control Theory
• Solution of the Sylvester matrix equation AXB ^T + CXD ^T = E
• A Self-Correcting Version of Karmarkar’s Algorithm

This page was built for publication: A primal-dual potential reduction method for problems involving matrix inequalities