scientific article; zbMATH DE number 915946

MaRDI QIDQ4889424zbMATH OpenFDO

Authors

Publication date 4 March 1998

zbMATH Keywords

convex programmingmultistep method4-step methodlinearized gradient iteration method

Mathematics Subject Classification ID

Convex programming (90C25) Methods of reduced gradient type (90C52)

Recommendations

• A three-step method of linearization for minimization problems
• scientific article; zbMATH DE number 915954
• scientific article; zbMATH DE number 1123897
• A three-step regularized method of linearization for solving minimization problems
• Publication:3496169

Cited in

(8)

• Iterative linearization in the method of barrier functions
• Four-parameter two-step projection minimization methods
• Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set
• ZFD formula \(4\mathrm{I}g\mathrm{SFD}\_\mathrm{Y}\) applied to future minimization
• A three-step method of linearization for minimization problems
• Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set
• scientific article; zbMATH DE number 915951 (Why is no real title available?)
• Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set

This page was built for publication:

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