On the rate of convergence of certain methods of centers

DOI10.1007/BF01584544zbMath0248.90048OpenAlexW1997927517MaRDI QIDQ5661332

Olivier Pironneau, Elijah Polak

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584544

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (29)

Global convergence and rate of convergence of a method of centers ⋮ Multistart method with estimation scheme for global satisfycing problems ⋮ Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints ⋮ Convergence analysis of norm-relaxed method of feasible directions ⋮ Self-tuning norm-relaxed method of feasible directions ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ Minimizing pseudoconvex functions on convex compact sets ⋮ On the rate of convergence of certain methods of centers ⋮ A new SQP method of feasible directions for nonlinear programming. ⋮ Method of centers for generalized fractional programming ⋮ A convergence analysis of the method of codifferential descent ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ A superlinearly convergent method of feasible directions. ⋮ An efficient sequential quadratic programming algorithm for nonlinear programming ⋮ Rates of convergence for a method of centers algorithm ⋮ On the rate of convergence of some feasible direction algorithms ⋮ On the Pironneau-Polak method of centers ⋮ A feasible interior-point algorithm for nonconvex nonlinear programming ⋮ Superlinearly convergent algorithm for min-max problems ⋮ Preface ⋮ A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization ⋮ Combined phase I—phase II methods of feasible directions ⋮ An active set sequential quadratic programming algorithm for nonlinear optimisation ⋮ A generalization of the norm-relaxed method of feasible directions ⋮ A method of centers algorithm for certain minimax problems ⋮ A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ Finite-termination schemes for solving semi-infinite satisfycing problems ⋮ On the rate of convergence of two minimax algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Simplex Method for Quadratic Programming
• A duality theorem for non-linear programming
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Programmation mathématique convexe
• Convex Analysis
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• A Dual Method for Optimal Control Problems with Initial and Final Boundary Constraints
• On the rate of convergence of certain methods of centers

This page was built for publication: On the rate of convergence of certain methods of centers