Shallow, deep and very deep cuts in the analytic center cutting plane method.

DOI10.1007/s10107980011azbMath1050.90550OpenAlexW1533092490MaRDI QIDQ1572672

Jean-Philippe Vial, Jean-Louis Goffin

Publication date: 21 July 2000

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

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

zbMATH Keywords

analytic centercutting plane methodprojective algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Programming in abstract spaces (90C48)

Related Items

Analytic center of spherical shells and its application to analytic center machine ⋮ A cutting plane method for solving KYP-SDPs ⋮ Specialized fast algorithms for IQC feasibility and optimization problems. ⋮ A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs ⋮ An oracle for the discrete-time integral quadratic constraint problem ⋮ Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method