Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method
From MaRDI portal
Publication:2337073
DOI10.1155/2015/456392zbMath1487.65066OpenAlexW2100479853WikidataQ59113015 ScholiaQ59113015MaRDI QIDQ2337073
Publication date: 19 November 2019
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/456392
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear inequalities of matrices (15A39) Numerical linear algebra (65F99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A scaling technique for finding the weighted analytic center of a polytope
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Determinant Maximization with Linear Matrix Inequality Constraints
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
This page was built for publication: Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method