A Mathematical View of Interior-Point Methods in Convex Optimization

DOI10.1137/1.9780898718812zbMath0986.90075OpenAlexW2165323796MaRDI QIDQ2756074

Publication date: 12 November 2001

Full work available at URL: https://doi.org/10.1137/1.9780898718812

convex optimization duality interior-point methods path-following methods barrier functionals self-concordant functionals

Mathematics Subject Classification ID

Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Tensors in computations, Diameter and Curvature: Intriguing Analogies, NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING, Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier, A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, Linear optimization over homogeneous matrix cones, Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size, A new perspective on low-rank optimization, A faster interior-point method for sum-of-squares optimization, Performance enhancements for a generic conic interior point algorithm, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Optimal step length for the maximal decrease of a self-concordant function by the Newton method, Convergence rate analysis of the multiplicative gradient method for PET-type problems, A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation, Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty, How Do Exponential Size Solutions Arise in Semidefinite Programming?, Unnamed Item, A self-concordant exponential kernel function for primal–dual interior-point algorithm, Probabilistic analyses of condition numbers, Application of facial reduction to H _∞ state feedback control problem, Preprocessing and Regularization for Degenerate Semidefinite Programs, Approximate minimum enclosing balls in high dimensions using core-sets, A Single-Phase, Proximal Path-Following Framework, Book Review: The basic George B. Dantzig, Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs, Exact Duality in Semidefinite Programming Based on Elementary Reformulations, A new outlier detection method based on convex optimization: application to diagnosis of Parkinson’s disease, Estimation in the partially nonlinear model by continuous optimization, Projectively Self-Concordant Barriers, Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder), Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets, Extreme points of well-posed polytopes, On the Computability of Continuous Maximum Entropy Distributions with Applications, A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities, Interior-point Lagrangian decomposition method for separable convex optimization, Cubic regularized Newton method for the saddle point models: a global and local convergence analysis, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization, Universal duality in conic convex optimization, Alfonso: Matlab Package for Nonsymmetric Conic Optimization, An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, A primal-dual symmetric relaxation for homogeneous conic systems, How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization, A primal barrier function phase I algorithm for nonsymmetric conic optimization problems, Improved approximation results on standard quartic polynomial optimization, A Self-Concordant Interior Point Approach for Optimal Control with State Constraints, Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones, Logarithmic-Barrier Decomposition Interior-Point Methods for Stochastic Linear Optimization in a Hilbert Space, Several Jordan-algebraic aspects of optimization†, Computation of channel capacity based on self-concordant functions, Terracini convexity, A simplified treatment of Ramana's exact dual for semidefinite programming, New bounds for nonconvex quadratically constrained quadratic programming, On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function, Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation, Bad Semidefinite Programs: They All Look the Same, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Hardness Results for Structured Linear Systems, Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods, Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions, On the complexity of the primal self-concordant barrier method., Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, Analysis of microstructures and phase transition phenomena in one-dimensional, non-linear elasticity by convex optimization, Antenna array synthesis with clusters of unmanned aerial vehicles, An entire space polynomial-time algorithm for linear programming, Separable self-concordant spectral functions and a conjecture of Tunçel, A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Sum-of-Squares Optimization without Semidefinite Programming, A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function, Stochastic 0-1 linear programming under limited distributional information, Polytopes and arrangements: diameter and curvature, Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs, Multirate multicast service provisioning. II: A tâtonnement process for rate allocation, On hyperbolicity cones associated with elementary symmetric polynomials, Stationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based Approximations, Learning semidefinite regularizers, Semidefinite programming and arithmetic circuit evaluation, Parabolic target space and primal-dual interior-point methods, Refining the partition for multifold conic optimization problems, Legendre transform and applications to finite and infinite optimization, A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, Hardness-packing density scaling relations for cohesive-frictional porous materials, Inexact proximal Newton methods for self-concordant functions, Risk management in uncapacitated facility location models with random demands, The mixing time of the Dikin walk in a polytope -- a simple proof, Finite Blaschke products with prescribed critical points, Stieltjes polynomials, and moment problems, The convergence of an interior point method for an elliptic control problem with mixed control-state constraints, Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms, Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, A new algorithm for concave quadratic programming, Conic systems and sublinear mappings: equivalent approaches., The Kantorovich theorem and interior point methods, Barrier function based model predictive control, On self-regular IPMs (with comments and rejoinder), Discretization method for semi-definite programming, Tractable approximations to robust conic optimization problems, Causal structure and algebraic classification of non-dissipative linear optical media, A numerical procedure for inferring from experimental data the optimization cost functions using a multibody model of the neuro-musculoskeletal system, Exponential varieties, Interior-point methods for optimization, An interior-point method for the single-facility location problem with mixed norms using a conic formulation, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, Intrinsic volumes of symmetric cones and applications in convex programming, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, Smaller SDP for SOS decomposition, A polynomial-time interior-point method for circular cone programming based on kernel functions, Projective re-normalization for improving the behavior of a homogeneous conic linear system, A continuous $d$-step conjecture for polytopes, On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming, New stopping criteria for detecting infeasibility in conic optimization, Low-Rank Approximation and Completion of Positive Tensors, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Optimal step length for the Newton method: case of self-concordant functions, Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension, Unnamed Item, Strong duality for standard convex programs, Trajectory Optimization Strategies for Supercavitating Underwater Vehicles, Bearing capacity of shallow foundations in transversely isotropic granular media, Improving complexity of structured convex optimization problems using self-concordant barriers, Extremum-seeking control of state-constrained nonlinear systems, Lexicographic differentiation of nonsmooth functions, An exterior point polynomial-time algorithm for convex quadratic programming, A Survey on Analog Models of Computation, A second-order method for strongly convex $\ell _1$-regularization problems