Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
From MaRDI portal
Publication:1922692
DOI10.1007/BF01585554zbMath0857.90101OpenAlexW2050388101MaRDI QIDQ1922692
Publication date: 11 March 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585554
convex optimizationnondifferentiable optimizationbundle methodsconvex-concave saddle-point problemsproximal level methodsvariational inequalities with monotone operators
Related Items
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization, A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study, Finding normal solutions in piecewise linear programming, Piecewise linear approximations in nonconvex nonsmooth optimization, Applications of gauge duality in robust principal component analysis and semidefinite programming, An optimal variant of Kelley's cutting-plane method, A Level-Set Method for Convex Optimization with a Feasible Solution Path, A bundle modification strategy for convex minimization, Fast proximal algorithms for nonsmooth convex optimization, Implementing the simplex method as a cutting-plane method, with a view to regularization, Rate of convergence of the bundle method, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, Level bundle methods for constrained convex optimization with various oracles, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, Optimal Convergence Rates for the Proximal Bundle Method, A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization, On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems., Asynchronous level bundle methods, General Hölder smooth convergence rates follow from specialized rates assuming growth bounds, Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse, Target radius methods for nonsmooth convex optimization, A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization, A bundle method for solving equilibrium problems, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, New bundle methods for solving Lagrangian relaxation dual problems, Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions, Interior proximal method for variational inequalities: Case of nonparamonotone operators, Non-Euclidean restricted memory level method for large-scale convex optimization, Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Using regularization and second order information in outer approximation for convex MINLP, Level bundle-like algorithms for convex optimization, An inexact bundle variant suited to column generation, Minimizing Piecewise-Concave Functions Over Polyhedra, Unnamed Item, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems, On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems, Efficiency of proximal bundle methods, Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization, A new restricted memory level bundle method for constrained convex nonsmooth optimization, Splitting-type method for systems of variational inequalities, Alternative regularizations for outer-approximation algorithms for convex MINLP, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, A doubly stabilized bundle method for nonsmooth convex optimization
Cites Work
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- Variable target value subgradient method
- Finding normal solutions in piecewise linear programming
- New variants of bundle methods
- Methods of descent for nondifferentiable optimization
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Polynomial algorithms for a class of linear programs
