Barrier Functions in Interior Point Methods
From MaRDI portal
Publication:4332255
DOI10.1287/moor.21.4.860zbMath0867.90090OpenAlexW2093249882MaRDI QIDQ4332255
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
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Convex functions and convex programs in convex geometry (52A41)
Related Items
An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path, Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, 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, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, An algorithm for nonsymmetric conic optimization inspired by MOSEK, An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization, Rank computation in Euclidean Jordan algebras, Todd's maximum-volume ellipsoid problem on symmetric cones, On the Computability of Continuous Maximum Entropy Distributions with Applications, Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming, A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity, Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, Solving Natural Conic Formulations with Hypatia.jl, A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming, On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials, OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS, THE CURVATURE OF A HESSIAN METRIC, Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions, A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization, A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization, On the symmetry of induced norm cones, Unnamed Item, Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization, Two wide neighborhood interior-point methods for symmetric cone optimization, A new infeasible-interior-point algorithm for linear programming over symmetric cones, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, Linear optimization over homogeneous matrix cones, \(L^{p}\)-norms, log-barriers and Cramer transform in optimization, Inradius and circumradius of various convex cones arising in applications, Real zeros of mixed random fewnomial systems, Volumes of Sublevel Sets of Nonnegative Forms and Complete Monotonicity, A new corrector-predictor interior-point method for symmetric cone optimization, Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, Performance enhancements for a generic conic interior point algorithm, Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs, Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions, Existence and uniqueness of solutions for homogeneous cone complementarity problems, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones, The \(Q\) method for symmetric cone programming, Semidefinite programming and matrix scaling over the semidefinite cone., On convex optimization without convex representation, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem, A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones, A new infeasible interior-point method based on Darvay's technique for symmetric optimization, A weighted-path-following method for symmetric cone linear complementarity problems, 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 new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs, Dual versus primal-dual interior-point methods for linear and conic programming, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, Inscribed and circumscribed ellipsoidal cones: volume ratio analysis, An axiomatic duality framework for the theta body and related convex corners, A polynomial primal-dual affine scaling algorithm for symmetric conic optimization, Largest dual ellipsoids inscribed in dual cones, A convex optimization method to solve a filter design problem, A self-concordant exponential kernel function for primal–dual interior-point algorithm, A Schwarz lemma for Kähler affine metrics and the canonical potential of a proper convex cone, Centers and partial volumes of convex cones. I: Basic theory, Reflection-projection method for convex feasibility problems with an obtuse cone, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization, Gaddum's test for symmetric cones, Unnamed Item, A mathematical programming model for computing the fries number of a fullerene, Exponential varieties, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Conic version of Loewner-John ellipsoid theorem, A convex optimization model for finding non-negative polynomials, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization, Intrinsic volumes of symmetric cones and applications in convex programming, Universal Barrier Is n-Self-Concordant, Unnamed Item, A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization, A polynomial-time interior-point method for circular cone programming based on kernel functions, Centers and partial volumes of convex cones. II: Advanced topics, On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones, Recursive construction of optimal self-concordant barriers for homogeneous cones, A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions, Similarity and other spectral relations for symmetric cones, Unnamed Item, Characterization of the barrier parameter of homogeneous convex cones, Canonical Barriers on Convex Cones, Unnamed Item, On self-concordant barriers for generalized power cones
