An interior point algorithm for global optimal solutions and KKT points

DOI10.1080/10556780108805820zbMath1109.90340OpenAlexW2090966845MaRDI QIDQ2770190

Graziella Pacelli, Maria Cristina Recchioni

Publication date: 7 February 2002

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780108805820

zbMATH Keywords

Interior point methodsGlobal optimizationKarush-Kuhn-Tucker points

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (3)

Global minimization using an augmented Lagrangian method with variable lower-level constraints ⋮ Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization ⋮ Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Stability by Liapunov's direct method. With applications
• A quadratically convergent method for linear programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• On the convergence of the projected gradient method
• Interior point methods of mathematical programming
• Monotone variable-metric algorithm for linearly constrained nonlinear programming
• Letter to the Editor—Linear Fractional Functionals Programming
• A Class of Fractional Programming Problems
• On the Convergence of Gradient Methods under Constraint

This page was built for publication: An interior point algorithm for global optimal solutions and KKT points