Rate of Convergence of a Class of Methods of Feasible Directions

DOI10.1137/0710017MaRDI QIDQ4769896zbMATH OpenOpenAlexFDO

Authors Olivier Pironneau, Elijah Polak

Publication date 1973

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0710017

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Cited in

(33)

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

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)