A method for convex minimization based on translated first-order approximations

DOI10.1007/s11075-017-0280-6zbMath1379.65034OpenAlexW2588292086WikidataQ62473064 ScholiaQ62473064MaRDI QIDQ1681778

Enrico Gorgone, Annabella Astorino, Manlio Gaudioso

Publication date: 24 November 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-017-0280-6

zbMATH Keywords

convergencenonsmooth optimizationconvex optimizationunconstrained minimizationbundle methodsnumerical resultmin-cost network flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (5)

Numerical infinitesimals in a variable metric method for convex nonsmooth optimization ⋮ Incremental Bundle Methods using Upper Models ⋮ Essentials of numerical nonsmooth optimization ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Essentials of numerical nonsmooth optimization

Uses Software

• PNEW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex proximal bundle methods in depth: a unified analysis for inexact oracles
• On solving the Lagrangian dual of integer programs via an incremental approach
• A bundle modification strategy for convex minimization
• A partially inexact bundle method for convex semi-infinite minmax problems
• Newton's method for convex programming and Tschebyscheff approximation
• A bundle-Newton method for nonsmooth unconstrained minimization
• Proximal quasi-Newton methods for nondifferentiable convex optimization
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
• New variants of bundle methods
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
• Methods of descent for nondifferentiable optimization
• Piecewise linear approximations in nonconvex nonsmooth optimization
• A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
• A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions
• Comparing different nonsmooth minimization methods and software
• Piecewise-quadratic Approximations in Convex Numerical Optimization
• The Cutting-Plane Method for Solving Convex Programs
• A bundle type approach to the unconstrained minimization of convex nonsmooth functions
• An Algorithm for Constrained Optimization with Semismooth Functions
• Variants to the cutting plane approach for convex nondifferentiable optimization
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• An Incremental Method for Solving Convex Finite Min-Max Problems
• Convex Analysis
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Benchmarking optimization software with performance profiles.

This page was built for publication: A method for convex minimization based on translated first-order approximations