Interior-point methods: An old and new approach to nonlinear programming
From MaRDI portal
Publication:1365059
DOI10.1007/BF02614321zbMath0887.90164OpenAlexW2069337595MaRDI QIDQ1365059
Publication date: 28 August 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614321
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items
The bundle scheme for solving arbitrary eigenvalue optimizations ⋮ Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization ⋮ A space decomposition scheme for maximum eigenvalue functions and its applications ⋮ A fast space-decomposition scheme for nonconvex eigenvalue optimization ⋮ An interior-point method for the single-facility location problem with mixed norms using a conic formulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Long-step strategies in interior-point primal-dual methods
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Multiplier and gradient methods
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- On the Computational Complexity of Combinatorial Problems
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Long Step Path Following and SUMT for Linear and Quadratic Programming
- Paths, Trees, and Flowers
