An aggregate subgradient method for nonsmooth convex minimization

DOI10.1007/BF02591907zbMath0525.90074OpenAlexW2039110678WikidataQ97724635 ScholiaQ97724635MaRDI QIDQ3039046

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591907

zbMATH Keywords

global convergence nonsmooth optimization subgradient descent methods unconstrained minimisation convex nondifferentiable objective function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Related Items

An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, An aggregate subgradient method for nonsmooth and nonconvex minimization, Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, On Poljak's improved subgradient method, A surrogate heuristic for set covering problems, The bundle scheme for solving arbitrary eigenvalue optimizations, A subgradient selection method for minimizing convex functions subject to linear constraints, A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, Nonconvex bundle method with application to a delamination problem, A class of convergent primal-dual subgradient algorithms for decomposable convex programs, A method of linearizations for linearly constrained nonconvex nonsmooth minimization, Piecewise linear approximations in nonconvex nonsmooth optimization, Non-smooth optimization for robust control of infinite-dimensional systems, \(r\)-algorithms and ellipsoids, A regularized decomposition method for minimizing a sum of polyhedral functions, Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, A matrix generation approach for eigenvalue optimization, Solving large-scale semidefinite programs in parallel, A generalized subgradient method with relaxation step, A bundle modification strategy for convex minimization, Untangling of 2D meshes in ALE simulations, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, New variants of bundle methods, Monotone methods with averaging of subgradients and their stochastic finite-difference analogs, The method of successive affine reduction for nonlinear minimization, Rate of convergence of the bundle method, Scenario decomposition of risk-averse multistage stochastic programming problems, Cutting plane oracles to minimize non-smooth non-convex functions, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, A version of bundle trust region method with linear programming, Adaptive Bundle Methods for Nonlinear Robust Optimization, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Approximate level method for nonsmooth convex minimization, A bundle-type method for nonsmooth DC programs, Optimal Convergence Rates for the Proximal Bundle Method, Proximity control in bundle methods for convex nondifferentiable minimization, A hierarchical approach to optimized control of water distribution systems: Part I decomposition, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization, Comparison of bundle and classical column generation, An adaptive competitive penalty method for nonsmooth constrained optimization, A parallel interior point decomposition algorithm for block angular semidefinite programs, Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization, Non-Euclidean restricted memory level method for large-scale convex optimization, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, Two-direction subgradient method for non-differentiable optimization problems, A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems, Stochastic dynamic cutting plane for multistage stochastic convex programs, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Essentials of numerical nonsmooth optimization, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications, A representation of generalized convex polyhedra and applications, Synthesis of cutting and separating planes in a nonsmooth optimization method, A non-monotone conjugate subgradient type method for minimization of convex functions, Diagonal discrete gradient bundle method for derivative free nonsmooth optimization, Subgradient algorithm on Riemannian manifolds, Convergence analysis of some methods for minimizing a nonsmooth convex function, Convergence analysis of a proximal newton method¹, Convergence of a generalized subgradient method for nondifferentiable convex optimization, A direct method of linearization for continuous minimax problems, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise, Convergence of the steepest descent method for minimizing quasiconvex functions, A splitting bundle approach for non-smooth non-convex minimization, A \(\mathcal{VU}\)-algorithm for convex minimization, A method for minimizing the sum of a convex function and a continuously differentiable function, An algorithm for linearly constrained convex nondifferentiable minimization problems, Essentials of numerical nonsmooth optimization, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization, Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results, Decomposition method of descent for minimizing the sum of convex nonsmooth functions, Nonmonotone bundle-type scheme for convex nonsmooth minimization, Convergence of some algorithms for convex minimization, Nonsmooth bundle trust-region algorithm with applications to robust stability

Cites Work