Rate of Convergence of a Class of Methods of Feasible Directions

Cited in

(33)

The computation of the Nash bargaining solution
Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization
On optimum design in fluid mechanics
Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
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 generalization of the norm-relaxed method of feasible directions
Minimization methods with constraints
A feasible direction algorithm for convex optimization: Global convergence rates
An interior point method for nonlinear programming
A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
An outer approximations algorithm for computer-aided design problems
Algorithms for a class of computer-aided design problems: A review
Convergence analysis of norm-relaxed method of feasible directions
Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent
A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
A sequential quadratically constrained quadratic programming method of feasible directions
Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
Norm-relaxed method of feasible directions for solving nonlinear programming problems
Self-tuning norm-relaxed method of feasible directions
Numerical study of some feasible direction methods in mathematical programming
Combined phase I—phase II methods of feasible directions
A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure
An active set sequential quadratic programming algorithm for nonlinear optimisation
New convergence theorems for a class of feasible directions algorithms
A superlinearly convergent method of feasible directions.
Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
On the rate of convergence of some feasible direction algorithms

This page was built for publication: Rate of Convergence of a Class of Methods of Feasible Directions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4769896)