Norm-relaxed method of feasible directions for solving nonlinear programming problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3562346 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- Generalization of Murty's direct algorithm to linear and convex quadratic programming
- More test examples for nonlinear programming codes
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Rate of Convergence of a Class of Methods of Feasible Directions
- Test examples for nonlinear programming codes
Cited in
(29)- scientific article; zbMATH DE number 4143788 (Why is no real title available?)
- Probabilistic version of the method of feasible directions.
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- 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 new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A feasible interior-point algorithm for nonconvex nonlinear programming
- Convergence analysis of norm-relaxed method of feasible directions
- Self-tuning norm-relaxed method of feasible directions
- A superlinearly convergent method of feasible directions.
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- A sequential quadratically constrained quadratic programming method of feasible directions
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- A new norm-relaxed SQP algorithm with global convergence
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
- A generalization of the norm-relaxed method of feasible directions
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- A quadratically approximate framework for constrained optimization, global and local convergence
This page was built for publication: Norm-relaxed method of feasible directions for solving nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338556)
