On some properties and an application of the logarithmic barrier method

DOI10.1007/s10107-006-0075-3zbMath1163.90696OpenAlexW2083806000WikidataQ58048506 ScholiaQ58048506MaRDI QIDQ2467165

Susana Scheimberg, L. M. Graña Drummond, Regina Sandra Burachik

Publication date: 21 January 2008

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

Full work available at URL: https://doi.org/10.1007/s10107-006-0075-3

zbMATH Keywords

EfficiencyCentral pathConvex vector optimizationLogarithmic barrierNonsmooth convex optimizationPoint-to-set theory

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scalarization of vector optimization problems
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• Nonlinear multiobjective optimization
• On the existence and convergence of the central path for convex programming and some duality results
• Steepest descent methods for multicriteria optimization.
• A steepest descent method for vector optimization
• Examples of ill-behaved central paths in convex optimization
• A projected gradient method for vector optimization problems
• Welldefinedness and limiting behavior of the central path
• On the choice of parameters for the weighting method in vector optimization
• Scalarization in vector optimization
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• A duality theorem for non-linear programming
• An Existence Theorem in Vector Optimization
• Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
• A First Course in Optimization Theory
• Variational Analysis
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• On the Convergence of the Central Path in Semidefinite Optimization
• Penalty and Barrier Methods: A Unified Framework
• Convex Analysis
• Logarithmic SUMT limits in convex programming