A primal-dual potential reduction method for problems involving matrix inequalities
type: Item
instance of: scholarly article
title: A primal-dual potential reduction method for problems involving matrix inequalities
zbMATH Open document ID: 0857.90104
DOI: 10.1007/BF01585558
author: Lieven Vandenberghe
author: Stephen Boyd
published in: Mathematical Programming. Series A. Series B
publication date: 1997-03-11T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 928075
zbMATH Keywords: semidefinite programming
zbMATH Keywords: potential reduction method
zbMATH Keywords: matrix inequalities
zbMATH Keywords: worst-case analysis
zbMATH Keywords: interior-point methods
describes a project that uses: CRAIG
describes a project that uses: RICPAC
describes a project that uses: LSQR
MaRDI profile type: Publication
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: Q4323601
cites work: A combined phase I-phase II scaled potential algorithm for linear programming
cites work: Q5527032
cites work: Potential Reduction Polynomial Time Method for Truss Topology Design
cites work: Method of centers for minimizing generalized eigenvalues
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
cites work: Q5583564
cites work: A Nonlinear Programming Problem in Statistics (Educational Testing)
cites work: Semi-Definite Matrix Constraints in Optimization
cites work: A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start''
cites work: Solution of the Sylvester matrix equation AXB T + CXD T = E
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: A relaxed version of Karmarkar's method
cites work: A Self-Correcting Version of Karmarkar’s Algorithm
cites work: Q3359644
cites work: A Hessenberg-Schur method for the problem AX + XB= C
cites work: Path-Following Methods for Linear Programming
cites work: An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
cites work: Geometric algorithms and combinatorial optimization
cites work: An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
cites work: Feasibility issues in a primal-dual interior-point method for linear programming
cites work: Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
cites work: Large-Scale Optimization of Eigenvalues
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
cites work: Algorithms for Minimum Trace Factor Analysis
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
full work available at URL: https://doi.org/10.1007/bf01585558
OpenAlex ID: W2168204766
description: scientific article; zbMATH DE number 928075