Interior-point algorithms for global optimization
From MaRDI portal
Publication:804475
DOI10.1007/BF02283687zbMath0727.90068OpenAlexW2317402599MaRDI QIDQ804475
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02283687
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Uses Software
Cites Work
- Computational experience with an interior point algorithm on the satisfiability problem
- A new polynomial-time algorithm for linear programming
- Constrained global optimization: algorithms and applications
- Checking local optimality in constrained quadratic programming is NP- hard
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A new continuation method for complementarity problems with uniform P- functions
- Sufficient matrices and the linear complementarity problem
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A class of linear complementarity problems solvable in polynomial time
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An interior point algorithm to solve computationally difficult set covering problems
- An interior point potential reduction algorithm for the linear complementarity problem
- On the solution of concave knapsack problems
- Complementary pivot theory of mathematical programming
- A Centered Projective Algorithm for Linear Programming
- The Simplex Method for Quadratic Programming
- Computing a Trust Region Step
- Some NP-complete problems in quadratic and nonlinear programming
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- Computing Optimal Locally Constrained Steps
- Newton-type methods for unconstrained and linearly constrained optimization
- Linear complementarity problems solvable by A single linear program
- Bimatrix Equilibrium Points and Mathematical Programming
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- A General Quadratic Programming Algorithm
- Polyhedral sets having a least element
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
