A generalization of the norm-relaxed method of feasible directions
From MaRDI portal
Publication:1294211
DOI10.1016/S0096-3003(98)10025-5zbMath0935.65064OpenAlexW2031807043MaRDI QIDQ1294211
Michael M. Kostreva, X. B. Chen
Publication date: 24 April 2000
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(98)10025-5
Related Items (19)
A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity ⋮ New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate ⋮ Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints ⋮ A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization ⋮ A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints ⋮ A variant of SQP method for inequality constrained optimization and its global convergence ⋮ A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization ⋮ A new SQP method of feasible directions for nonlinear programming. ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming ⋮ A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems ⋮ Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ A superlinearly convergent method of feasible directions. ⋮ An efficient sequential quadratic programming algorithm for nonlinear programming ⋮ A new norm-relaxed SQP algorithm with global convergence ⋮ An active set sequential quadratic programming algorithm for nonlinear optimisation ⋮ A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalization of Murty's direct algorithm to linear and convex quadratic programming
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- On the rate of convergence of some feasible direction algorithms
- On the Pironneau-Polak method of centers
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- Convergence analysis of norm-relaxed method of feasible directions
- Self-tuning norm-relaxed method of feasible directions
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- Combined phase I—phase II methods of feasible directions
- Rate of Convergence of a Class of Methods of Feasible Directions
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- On the rate of convergence of certain methods of centers
This page was built for publication: A generalization of the norm-relaxed method of feasible directions
