New convergence theorems for a class of feasible directions algorithms

DOI10.1007/BF00934365zbMath0458.90063OpenAlexW2000529729MaRDI QIDQ1151828

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

convergence propertiesantijamming featuresfeasible directions algorithmsmultistep constrained optimization algorithms

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for some minimax problems
• A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps
• A General Theory of Convergence for Constrained Optimization Algorithms that Use Antizigzagging Provisions
• Feasible directions algorithms for optimization problems with equality and inequality constraints
• An algorithm for optimization problems with functional inequality constraints
• Combined phase I—phase II methods of feasible directions
• Rate of Convergence of a Class of Methods of Feasible Directions
• A Dual Method for Optimal Control Problems with Initial and Final Boundary Constraints
• A Convergence Theory for a Class of Nonlinear Programming Problems