A Convergence Theory for a Class of Nonlinear Programming Problems

DOI10.1137/0710021zbMATH Open0258.90042OpenAlexW1977884107MaRDI QIDQ5675554FDOQ5675554

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

Recommendations

• scientific article; zbMATH DE number 3898606
• scientific article
• 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

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• New convergence theorems for a class of feasible directions algorithms
• Minimization methods with constraints
• Title not available (Why is that?)
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• On the Convergence of an Optimization Algorithm Based on Nonlinear Operators
• Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming
• Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints

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)