On the convergence of sequential minimization algorithms

DOI10.1007/BF00933310MaRDI QIDQ5917363zbMATH OpenOpenAlexFDO

Authors

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)

Cites work

• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• Minimization of functions having Lipschitz continuous first partial derivatives
• On the convergence of sequential minimization algorithms

Cited in

(6)

• Optimization algorithm with probabilistic estimation
• Family of projected descent methods for optimization problems with simple bounds
• 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
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• Preface

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5917363)