Augmented self-concordant barriers and nonlinear optimization problems with finite complexity

DOI10.1007/s10107-003-0392-8zbMath1059.90129OpenAlexW1987602884MaRDI QIDQ1424292

Yu. E. Nesterov, Jean-Philippe Vial

Publication date: 11 March 2004

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

Full work available at URL: https://archive-ouverte.unige.ch/unige:5851

zbMATH Keywords

nonlinear optimizationcentral pathbarrier functionfinite polynomial complexity

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)

Related Items (3)

A simple method for convex optimization in the oracle model ⋮ Quadratic regularizations in an interior-point method for primal block-angular problems ⋮ On solving large-scale finite minimax problems using exponential smoothing

This page was built for publication: Augmented self-concordant barriers and nonlinear optimization problems with finite complexity