Rate of Convergence of a Class of Methods of Feasible Directions

DOI10.1137/0710017zbMath0283.65032OpenAlexW2059226747MaRDI QIDQ4769896

Elijah Polak, Olivier Pironneau

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)

Related Items (33)

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

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