Barrier Functions in Interior Point Methods

DOI10.1287/MOOR.21.4.860zbMATH Open0867.90090OpenAlexW2093249882MaRDI QIDQ4332255FDOQ4332255

Authors: Osman Güler 

Publication date: 13 February 1997

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/828460ab14d99859829764717075509e1cb5e927

Recommendations

• An extended mathematical framework for Barrier methods in function space
• Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs
• A note on the use of vector barrier parameters for interior-point methods
• Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
• Primal-dual interior point method based on a new barrier function
• An interior-point algorithm for linear optimization based on a new barrier function
• Iterative linearization in the method of barrier functions
• A barrier function method for minimax problems
• scientific article; zbMATH DE number 686912
• The role of linear objective functions in barrier methods

zbMATH Keywords

convex conehomogeneous conesuniversal barrier function

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Convex functions and convex programs in convex geometry (52A41)

Cited In (only showing first 100 items - show all)

• Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• Characterization of the barrier parameter of homogeneous convex cones
• Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
• An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood
• A Schwarz lemma for Kähler affine metrics and the canonical potential of a proper convex cone
• On the \(P_*(\kappa)\) horizontal linear complementarity problems over Cartesian product of symmetric cones
• Linear optimization over homogeneous matrix cones
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• Canonical barriers on convex cones
• Semidefinite programming and matrix scaling over the semidefinite cone.
• Barriers on projective convex sets
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization
• OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS
• Calculation of Universal Barrier Functions for Cones Generated by Chebyshev Systems Over Finite Sets
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Existence and uniqueness of solutions for homogeneous cone complementarity problems
• Exponential varieties
• Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
• Reflection-projection method for convex feasibility problems with an obtuse cone
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
• Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• On the computability of continuous maximum entropy distributions with applications
• A mathematical programming model for computing the fries number of a fullerene
• On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials
• Conic version of Loewner-John ellipsoid theorem
• Computing Opaque Interior Barriers à la Shermer
• Solving Natural Conic Formulations with Hypatia.jl
• A polynomial-time interior-point method for circular cone programming based on kernel functions
• Centers and partial volumes of convex cones. II: Advanced topics
• Recursive construction of optimal self-concordant barriers for homogeneous cones
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
• Inradius and circumradius of various convex cones arising in applications
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
• \(L^{p}\)-norms, log-barriers and Cramer transform in optimization
• Numerical experiments with universal barrier functions for cones of Chebyshev systems
• An introduction to formally real Jordan algebras and their applications in optimization
• A weighted-path-following method for symmetric cone linear complementarity problems
• On the self-duality and homogeneity of ellipsoidal cones
• A barrier method for mean curvature problems
• Largest dual ellipsoids inscribed in dual cones
• Similarity and other spectral relations for symmetric cones
• A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
• The \(Q\) method for symmetric cone programming
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
• A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
• Self-scaled barrier functions on symmetric cones and their classification
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
• A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
• Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
• On convex optimization without convex representation
• Centers and partial volumes of convex cones. I: Basic theory
• New self-concordant barrier for the hypercube
• A convex optimization method to solve a filter design problem
• A new infeasible-interior-point algorithm for linear programming over symmetric cones
• THE CURVATURE OF A HESSIAN METRIC
• Dual versus primal-dual interior-point methods for linear and conic programming
• An axiomatic duality framework for the theta body and related convex corners
• Intrinsic volumes of symmetric cones and applications in convex programming
• Logarithmic barriers for sparse matrix cones
• Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
• A long-step interior-point algorithm for symmetric cone Cartesian \(P_\ast (\kappa)\)-HLCP
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
• Title not available (Why is that?)
• Real zeros of mixed random fewnomial systems
• A convex optimization model for finding non-negative polynomials
• Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
• Universal Barrier Is n-Self-Concordant
• Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs
• Self-concordant barriers for hyperbolic means
• An \(\operatorname{O}(\sqrt{r}(\operatorname{cond}(G))^{1 / 4}\log \varepsilon^{- 1})\) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
• Inscribed and circumscribed ellipsoidal cones: volume ratio analysis
• An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
• A corrector-predictor interior-point algorithm for \(P_\ast(\kappa)\)-HLCPs over Cartesian product of symmetric cones
• On self-concordant barriers for generalized power cones
• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
• A self-concordant exponential kernel function for primal-dual interior-point algorithm
• Computing conjugate barrier information for nonsymmetric cones
• New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
• Gaddum's test for symmetric cones
• A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds
• A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
• A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
• A lower bound on the barrier parameter of barriers for convex cones
• Performance enhancements for a generic conic interior point algorithm
• A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
• The entropic barrier: exponential families, log-concave geometry, and self-concordance
• A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
• Proscribed normal decompositions of Euclidean Jordan algebras
• An algorithm for nonsymmetric conic optimization inspired by MOSEK
• Rank computation in Euclidean Jordan algebras
• Todd's maximum-volume ellipsoid problem on symmetric cones
• Two wide neighborhood interior-point methods for symmetric cone optimization

This page was built for publication: Barrier Functions in Interior Point Methods

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