scientific article; zbMATH DE number 125259

MaRDI QIDQ4026952zbMATH OpenFDO

Authors

Publication date 21 February 1993

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convex programming (90C25)

Recommendations

• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
• Superlinear rate of convergence and optimal acceleration schemes in the solution of convex inequality problems.
• scientific article; zbMATH DE number 151654
• scientific article; zbMATH DE number 1209819

Cited in

(8)

• Globale Superkonvergenz bei der Lösung von linearen Randwertaufgaben
• Separating plane algorithms for convex optimization
• Approximation and learning of convex superpositions
• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
• Computational experience and challenges with the conjugate epi-projection algorithms for non-smooth optimization
• Superlinear convergence of conjugate gradients
• Superlinear rate of convergence and optimal acceleration schemes in the solution of convex inequality problems.
• A superlinearly convergent subgradient method for sharp semismooth problems

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 Q4026952)