A descent method with linear programming subproblems for nondifferentiable convex optimization
From MaRDI portal
Publication:1924056
DOI10.1007/BF01592242zbMath0855.90101OpenAlexW1976285162MaRDI QIDQ1924056
Sehun Kim, Kun-Nyeong Chang, Jun-Yeon Lee
Publication date: 13 October 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01592242
Related Items
Lower bounding procedure for the asymmetric quadratic traveling salesman problem ⋮ A simple version of bundle method with linear programming ⋮ A tutorial on column generation and branch-and-price for vehicle routing problems ⋮ Interior point stabilization for column generation ⋮ An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts ⋮ Comparison of bundle and classical column generation ⋮ On the choice of explicit stabilizing terms in column generation ⋮ A proximal trust-region algorithm for column generation stabilization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Variable target value subgradient method
- A Method of Solution for Quadratic Programs
- A descent algorithm for nonsmooth convex optimization
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- Monotone Operators and the Proximal Point Algorithm
- Numerical methods for nondifferentiable convex optimization
- Convex Analysis
- Minimization of unsmooth functionals
