Interior-point methods

DOI10.1016/S0377-0427(00)00433-7zbMath0967.65078WikidataQ59411949 ScholiaQ59411949MaRDI QIDQ1593831

Florian A. Potra, Stephen J. Wright

Publication date: 25 January 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmslinear programmingconvex programminginterior-point methodssemi-definite programmingconvex quadratic programmingmonotone linear complementarity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Complexity and performance of numerical algorithms (65Y20)

Related Items (67)

Robust parameter design and optimization for quality engineering ⋮ Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ Koopman operator method for solution of generalized aggregate data inverse problems ⋮ A new interior-point approach for large separable convex quadratic two-stage stochastic problems ⋮ Provable randomized rounding for minimum-similarity diversification ⋮ A method for weighted projections to the positive definite cone ⋮ Primal-dual nonlinear rescaling method for convex optimization ⋮ Spectral radius minimization for optimal average consensus and output feedback stabilization ⋮ Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems ⋮ A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming ⋮ Generically globally rigid graphs have generic universally rigid frameworks ⋮ A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint ⋮ A selective strategy for shakedown analysis of engineering structures ⋮ Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem ⋮ Formulation for wave propagation in dissipative media and its application to absorbing layers in elastoplastic analysis using mathematical programming ⋮ A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications ⋮ Distance geometry and data science ⋮ Cooperative payload transportation with real-time formation control of multi-quadrotors in the presence of uncertainty ⋮ Explicit explore, exploit, or escape \((E^4)\): near-optimal safety-constrained reinforcement learning in polynomial time ⋮ The Frank-Wolfe algorithm: a short introduction ⋮ Nonparametric density estimation with nonuniform B-spline bases ⋮ A family of symmetric, optimized quadrature rules for pentatopes ⋮ Shakedown analysis with multidimensional loading spaces ⋮ Lattice enumeration via linear programming ⋮ A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ Control parameterization approach to time-delay optimal control problems: a survey ⋮ An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming ⋮ Numerical lower bound shakedown analysis of engineering structures ⋮ Calmness of partially perturbed linear systems with an application to the central path ⋮ An unsupervised stereo matching cost based on sparse representation ⋮ Unnamed Item ⋮ Extension of primal-dual interior point methods to diff-convex problems on symmetric cones ⋮ A non-interior-point smoothing method for variational inequality problem ⋮ A Fast Algorithm for Maximum Likelihood Estimation of Mixture Proportions Using Sequential Quadratic Programming ⋮ Stochastic task networks -- trading performance for stability ⋮ Dynamic temporal decoupling ⋮ The Kantorovich theorem and interior point methods ⋮ A polynomial interior-point algorithm with improved iteration bounds for linear optimization ⋮ Short proofs of ideal membership ⋮ Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem ⋮ Solving variational inequalities and cone complementarity problems in nonsmooth dynamics using the alternating direction method of multipliers ⋮ Gradient preserving operator inference: data-driven reduced-order models for equations with gradient structure ⋮ Semi-definite programming and quantum information ⋮ Functional linear quantile regression on a two-dimensional domain ⋮ On second-order cone functions ⋮ A quadratically convergent sequential programming method for second-order cone programs capable of warm starts ⋮ Inexact log-domain interior-point methods for quadratic programming ⋮ Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming ⋮ A fast algorithm for non-negativity model selection ⋮ Performance bounds for linear stochastic control ⋮ Random Projections for Linear Programming ⋮ An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems ⋮ Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique ⋮ A primal-dual predictor-corrector interior point method for non-smooth contact dynamics ⋮ A lower bound for the area of plateau foams ⋮ Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme ⋮ Minimum-time speed optimisation over a fixed path ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique ⋮ Accelerating opponent strategy inference for voting dynamics on complex networks ⋮ Approximate dynamic programming via iterated Bellman inequalities ⋮ Lagrangian transformation and interior ellipsoid methods in convex optimization ⋮ Global convergence enhancement of classical linesearch interior point methods for MCPs ⋮ A quantum interior-point predictor–corrector algorithm for linear programming ⋮ Time-varying output-based Takagi–Sugeno fuzzy controller of uncertain nonlinear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Superlinear convergence of interior-point algorithms for semidefinite programming
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Multiple centrality corrections in a primal-dual method for linear programming
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• On the Implementation of a Primal-Dual Interior Point Method
• A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• Semidefinite Programming
• On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming

This page was built for publication: Interior-point methods