A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems

DOI10.1137/51052623496311880zbMath0912.90232OpenAlexW2084556800MaRDI QIDQ4229466

F. Sharifi Mokhtarian, Jean-Louis Goffin

Publication date: 22 February 1999

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/89f9b547397627cacb656fb31b3f281246929f83

zbMATH Keywords

convex programminginterior-point methodsanalytic centercutting planespotential functionself-concordance

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Related Items (10)

Analytic center cutting plane methods for variational inequalities over convex bodies ⋮ Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem ⋮ Recursive central rounding for mixed integer programs ⋮ A variable metric method for nonsmooth convex constrained optimization ⋮ A path-following cutting plane method for some monotone variational inequalities^∗ ⋮ Polynomial Interior Point Cutting Plane Methods ⋮ A filter-variable-metric method for nonsmooth convex constrained optimization ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming ⋮ Homogeneous analytic center cutting plane methods with approximate centers

This page was built for publication: A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems