Norm-relaxed method of feasible directions for solving nonlinear programming problems
From MaRDI portal
Publication:1338556
DOI10.1007/BF02190059zbMath0828.90117MaRDI QIDQ1338556
Michael M. Kostreva, M. E. Cawood
Publication date: 1 December 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (28)
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 ⋮ Quadratically constraint quadratical algorithm model for nonlinear minimax problems ⋮ Convergence analysis of norm-relaxed method of feasible directions ⋮ 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 ⋮ Self-tuning norm-relaxed method of feasible directions ⋮ A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ 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 quadratically approximate framework for constrained optimization, global and local convergence ⋮ 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 superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ A superlinearly convergent method of feasible directions. ⋮ A new norm-relaxed SQP algorithm with global convergence ⋮ A feasible interior-point algorithm for nonconvex nonlinear programming ⋮ An active set sequential quadratic programming algorithm for nonlinear optimisation ⋮ Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD ⋮ A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions 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 ⋮ A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ Probabilistic version of the method of feasible directions.
Cites Work
- 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
- Rate of Convergence of a Class of Methods of Feasible Directions
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Unnamed Item
- Unnamed Item
This page was built for publication: Norm-relaxed method of feasible directions for solving nonlinear programming problems
