On some properties and an application of the logarithmic barrier method

DOI10.1007/S10107-006-0075-3zbMATH Open1163.90696OpenAlexW2083806000WikidataQ58048506 ScholiaQ58048506MaRDI QIDQ2467165FDOQ2467165

R. S. Burachik, Susana Scheimberg, L. M. Graña Drummond

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

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.

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

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

Cited In (4)

• Title not available (Why is that?)
• The \(B\)-bar method and the limitation principles
• Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications
• Title not available (Why is that?)

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)