On the convergence of sequential minimization algorithms

DOI10.1007/BF00933310zbMath0281.65044OpenAlexW4247867551MaRDI QIDQ5917363

No author found.

Publication date: 1974

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (6)

Family of projected descent methods for optimization problems with simple bounds ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints ⋮ An introduction to designh optimality with an overview of the literature ⋮ Preface ⋮ Optimization algorithm with probabilistic estimation

Cites Work

• Minimization of functions having Lipschitz continuous first partial derivatives
• On the convergence of sequential minimization algorithms
• Unnamed Item

This page was built for publication: On the convergence of sequential minimization algorithms