Non-Euclidean restricted memory level method for large-scale convex optimization

DOI10.1007/s10107-004-0553-4zbMath1066.90079OpenAlexW2006118023WikidataQ57392923 ScholiaQ57392923MaRDI QIDQ1774171

Publication date: 29 April 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0553-4

zbMATH Keywords

variational inequalities saddle point large-scale nonsmooth convex functions over simple domains non-Lipschitzian convex objectives subgradient-type method

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Variational inequalities (49J40)

Related Items

Comparing different nonsmooth minimization methods and software, Applications of gauge duality in robust principal component analysis and semidefinite programming, An optimal variant of Kelley's cutting-plane method, Level bundle methods for oracles with on-demand accuracy, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras, Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems, Accelerated schemes for a class of variational inequalities, Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, Stochastic first-order methods for convex and nonconvex functional constrained optimization, An optimal method for stochastic composite optimization, Target radius methods for nonsmooth convex optimization, Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem, Approximation bounds for sparse principal component analysis, Dual subgradient algorithms for large-scale nonsmooth learning problems, Diagonal bundle method for nonsmooth sparse optimization, Proximal bundle methods for nonsmooth DC programming, Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, On a Solving Bilevel D.C.-Convex Optimization Problems, Level bundle-like algorithms for convex optimization, An inexact bundle variant suited to column generation, Generalized uniformly optimal methods for nonlinear programming, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems, Subgradient and Bundle Methods for Nonsmooth Optimization, On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems, On the generalization of ECP and OA methods to nonsmooth convex MINLP problems, Solving variational inequalities with Stochastic Mirror-Prox algorithm, A new restricted memory level bundle method for constrained convex nonsmooth optimization, Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support, An outer-approximation guided optimization approach for constrained neural network inverse problems, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes, A non-monotonic method for large-scale non-negative least squares, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization, On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game, A doubly stabilized bundle method for nonsmooth convex optimization

Cites Work