Constructing Mixed Algorithms on the Basis of Some Bundle Method

DOI10.1007/978-3-030-58657-7_14zbMath1460.90139OpenAlexW3084856467MaRDI QIDQ4965109

Rashid Samatovich Yarullin

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_14

zbMATH Keywords

convex functionsnondifferentiable optimizationcutting planesbundle methodssequence of approximationsmixed algorithms

Mathematics Subject Classification ID

Convex programming (90C25)

Uses Software

• PLCP

Cites Work

• Cutting-plane method based on epigraph approximation with discarding the cutting planes
• One approach to constructing cutting algorithms with dropping of cutting planes
• Efficiency of proximal bundle methods
• A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing Mixed Algorithms on the Basis of Some Bundle Method