A generalization of the norm-relaxed method of feasible directions
From MaRDI portal
(Redirected from Publication:1294211)
The paper deals with the method of feasible directions where an ellipsoidal norm term is added in the objective function of the feasible direction search program.
Recommendations
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- Convergence analysis of norm-relaxed method of feasible directions
- A feasible directions method for nonsmooth convex optimization
- scientific article; zbMATH DE number 4047452
- The regularized feasible directions method for nonconvex optimization
- Self-tuning norm-relaxed method of feasible directions
- scientific article; zbMATH DE number 1925785
- scientific article; zbMATH DE number 67982
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
Cites work
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- Combined phase I—phase II methods of feasible directions
- Convergence analysis of norm-relaxed method of feasible directions
- Generalization of Murty's direct algorithm to linear and convex quadratic programming
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3993295 (Why is no real title available?)
- More test examples for nonlinear programming codes
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- On the Pironneau-Polak method of centers
- On the rate of convergence of certain methods of centers
- On the rate of convergence of some feasible direction algorithms
- Rate of Convergence of a Class of Methods of Feasible Directions
- Self-tuning norm-relaxed method of feasible directions
- Test examples for nonlinear programming codes
Cited in
(19)- A new SQP method of feasible directions for nonlinear programming.
- An efficient sequential quadratic programming algorithm for nonlinear programming
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- 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 variant of SQP method for inequality constrained optimization and its global convergence
- 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
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- A superlinearly convergent method of feasible directions.
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- 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 new norm-relaxed SQP algorithm with global convergence
This page was built for publication: A generalization of the norm-relaxed method of feasible directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294211)
