Rate of Convergence of a Class of Methods of Feasible Directions

Cited In (33)

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

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)