New convergence theorems for a class of feasible directions algorithms

DOI10.1007/BF00934365MaRDI QIDQ1151828zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1982

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

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

zbMATH Keywords

antijamming featuresconvergence propertiesfeasible directions algorithmsmultistep constrained optimization algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps
• A Convergence Theory for a Class of Nonlinear Programming Problems
• A Dual Method for Optimal Control Problems with Initial and Final Boundary Constraints
• A General Theory of Convergence for Constrained Optimization Algorithms that Use Antizigzagging Provisions
• Algorithms for some minimax problems
• An algorithm for optimization problems with functional inequality constraints
• Combined phase I—phase II methods of feasible directions
• Feasible directions algorithms for optimization problems with equality and inequality constraints
• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3402375 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• Rate of Convergence of a Class of Methods of Feasible Directions

Cited in

(2)

• Convergence analysis of norm-relaxed method of feasible directions
• Self-tuning norm-relaxed method of feasible directions

This page was built for publication: New convergence theorems for a class of feasible directions algorithms

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