Polyak minorant method for convex optimization

DOI10.1007/S10957-024-02412-7MaRDI QIDQ6655787zbMATH OpenFDO

Authors Nikhil Devanathan, Stephen W. Boyd

Publication date 27 December 2024

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-024-02412-7

zbMATH Keywords

bundle methodsconvex optimizationcutting-plane methodsfirst-order methods

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20) Numerical methods based on nonlinear programming (49M37) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cites work

• Affine minorants minimizing the sum of convex functions
• Algorithms for stochastic optimization with function or expectation constraints
• An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
• Convergence rate of the gradient descent method with dilatation of the space
• CVXPY: a Python-embedded modeling language for convex optimization
• Disciplined convex programming
• Einführung in die Determinantentheorie einschließlich der unendlichen und der \textit{Fredholm}schen Determinanten.
• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 3724209 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• scientific article; zbMATH DE number 3313108 (Why is no real title available?)
• Implementation of an oracle-structured bundle method for distributed optimization
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
• Lectures on convex optimization
• Linear Matrix Inequalities in System and Control Theory
• Minimization of unsmooth functionals
• New variants of bundle methods
• Newton's method for convex programming and Tschebyscheff approximation
• On convergence rates of subgradient optimization methods
• OSQP: an operator splitting solver for quadratic programs
• Proximity control in bundle methods for convex nondifferentiable minimization
• Stochastic gradient descent with Polyak's learning rate
• Subgradient methods for sharp weakly convex functions
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• The CoMirror algorithm for solving nonsmooth constrained convex problems
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(1)

• Dual adaptive stochastic block projection algorithm for solving convex feasibility problem in support vector machines

This page was built for publication: Polyak minorant method for convex optimization

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