A Convergence Theory for a Class of Nonlinear Programming Problems

DOI10.1137/0710021MaRDI QIDQ5675554zbMATHOpenAlexFDO

Authors Steven W. Rauch

Publication date 1973

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0710021

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 3898606
• scientific article; zbMATH DE number 123747
• scientific article; zbMATH DE number 3894847
• Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent
• scientific article; zbMATH DE number 943295

Cited in

(9)

• Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming
• scientific article; zbMATH DE number 147744 (Why is no real title available?)
• Minimization methods with constraints
• On the Convergence of an Optimization Algorithm Based on Nonlinear Operators
• Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints
• scientific article; zbMATH DE number 4108541 (Why is no real title available?)
• New convergence theorems for a class of feasible directions algorithms
• scientific article; zbMATH DE number 108527 (Why is no real title available?)
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point

This page was built for publication: A Convergence Theory for a Class of Nonlinear Programming Problems

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