Computational experience and challenges with the conjugate epi-projection algorithms for non-smooth optimization

DOI10.1007/978-3-030-38603-0_32zbMATH Open1477.90064OpenAlexW2999822319MaRDI QIDQ1982928FDOQ1982928

Authors: E. A. Nurminski, Natalia B. Shamray 

Publication date: 14 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_32

Recommendations

• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
• Separating plane algorithms for convex optimization
• A conjugate projection gradient algorithm for nonlinear constrained optimization
• Method of conjugate subgradients with constrained memory
• scientific article; zbMATH DE number 125259

zbMATH Keywords

convex optimizationprojectionquadratic convergenceepigraphfinite convergenceconjugate functionsuper-linear convergenceapproximate sub-differential

Mathematics Subject Classification ID

Convex programming (90C25)

Cited In (1)

• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence

This page was built for publication: Computational experience and challenges with the conjugate epi-projection algorithms for non-smooth optimization

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