On some properties and an application of the logarithmic barrier method

DOI10.1007/S10107-006-0075-3MaRDI QIDQ2467165zbMATH OpenOpenAlexWikidataFDO

Authors L. M. Graña Drummond, Susana Scheimberg, R. S. 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)

Recommendations

• Barrier method in nonsmooth convex optimization without convex representation
• A logarithm barrier function method
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• A barrier method in convex vector optimization with generalized inequality constraints
• Two logarithmic barrier methods for convex semi-infinite problems.

Cites work

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

Cited in

(7)

• scientific article; zbMATH DE number 1568994 (Why is no real title available?)
• On using absolute norms, especially \(p\)-norms, to generate convex log barriers for constrained convex optimization
• The B-bar method and the limitation principles
• Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications
• Barrier subgradient method
• Barrier method in nonsmooth convex optimization without convex representation
• scientific article; zbMATH DE number 2069317 (Why is no real title available?)

This page was built for publication: On some properties and an application of the logarithmic barrier method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467165)