Interior-point methods: An old and new approach to nonlinear programming
From MaRDI portal
(Redirected from Publication:1365059)
Cites work
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3361691 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Long-step strategies in interior-point primal-dual methods
- Multiplier and gradient methods
- On Long Step Path Following and SUMT for Linear and Quadratic Programming
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- On the Computational Complexity of Combinatorial Problems
- Paths, Trees, and Flowers
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Cited in
(6)- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- A space decomposition scheme for maximum eigenvalue functions and its applications
- The bundle scheme for solving arbitrary eigenvalue optimizations
- scientific article; zbMATH DE number 194636 (Why is no real title available?)
- 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
This page was built for publication: Interior-point methods: An old and new approach to nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365059)
