A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
From MaRDI portal
Publication:1205504
DOI10.1007/BF01371083zbMath0770.90049MaRDI QIDQ1205504
Publication date: 1 April 1993
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
rate of convergenceconstrained optimizationlinear convergenceinequality-constrained minimizationmethods of feasible directionsgeneralized quadratic programglobally convergent phase I-phase II algorithm
Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate, Quadratically constraint quadratical algorithm model for nonlinear minimax problems, Self-tuning norm-relaxed method of feasible directions, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming, An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming, A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results, An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems, On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems, A sequential quadratically constrained quadratic programming method of feasible directions, Newton-type methods: a broader view, Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization, Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions, A generalization of the norm-relaxed method of feasible directions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Test examples for nonlinear programming codes
- On the Pironneau-Polak method of centers
- On the rate of convergence of two minimax algorithms
- Minimization of functions having Lipschitz continuous first partial derivatives
- Computing a Trust Region Step
- Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization
- A regularized decomposition method for minimizing a sum of polyhedral functions
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Exact penalty functions in nonlinear programming
- A Second-order method for the discrete min-max problem
- A surperlinearly convergent algorithm for constrained optimization problems
- Some methods of solving convex programming problems
- On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
- A Penalty Function Method Converging Directly to a Constrained Optimum
- Simplicial decomposition in nonlinear programming algorithms
- Combined phase I—phase II methods of feasible directions
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Programmation mathématique convexe
- Second Order Conditions for Constrained Minima
- On the rate of convergence of certain methods of centers
- Constrained Optimization Using a Nondifferentiable Penalty Function
- A computational comparison of some non-linear programs
