On computing the center of a convex quadratically constrained set

DOI10.1007/BF01594926zbMath0723.90060OpenAlexW2059724554MaRDI QIDQ2276879

Sanjay Mehrotra, Jie Sun

Publication date: 1991

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

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

zbMATH Keywords

interior point methodconvex quadratic programminganalytic center

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming ⋮ A long-step barrier method for convex quadratic programming ⋮ Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming

Cites Work

• On the convergence of the method of analytic centers when applied to convex quadratic programs
• Optimization of “$\log x$” Entropy over Linear Equality Constraints
• A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs

This page was built for publication: On computing the center of a convex quadratically constrained set