An aggregate subgradient method for nonsmooth convex minimization
From MaRDI portal
Cites work
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- Finding the nearest point in A polytope
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 3641191 (Why is no real title available?)
- scientific article; zbMATH DE number 3793788 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Quasi-Newton Methods, Motivation and Theory
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(86)- 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 method for minimizing the sum of a convex function and a continuously differentiable function
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- An aggregate subgradient method for nonsmooth and nonconvex minimization
- On Poljak's improved subgradient method
- A subgradient selection method for minimizing convex functions subject to linear constraints
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Subgradient algorithm on Riemannian manifolds
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- Convergence of some algorithms for convex minimization
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- A surrogate heuristic for set covering problems
- r-algorithms and ellipsoids
- Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Non-smooth optimization for robust control of infinite-dimensional systems
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Non-Euclidean restricted memory level method for large-scale convex optimization
- A direct method of linearization for continuous minimax problems
- A generalized subgradient method with relaxation step
- New variants of bundle methods
- Scenario decomposition of risk-averse multistage stochastic programming problems
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- Stochastic dynamic cutting plane for multistage stochastic convex programs
- A non-monotone conjugate subgradient type method for minimization of convex functions
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Rate of convergence of the bundle method
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Comparison of bundle and classical column generation
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Convergence of the steepest descent method for minimizing quasiconvex functions
- A \(\mathcal{VU}\)-algorithm for convex minimization
- The bundle scheme for solving arbitrary eigenvalue optimizations
- A subgradient method based on gradient sampling for solving convex optimization problems
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Nonconvex bundle method with application to a delamination problem
- Monotone methods with averaging of subgradients and their stochastic finite-difference analogs
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- A regularized decomposition method for minimizing a sum of polyhedral functions
- The method of successive affine reduction for nonlinear minimization
- A hierarchical approach to optimized control of water distribution systems: Part I decomposition
- Approximate level method for nonsmooth convex minimization
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Convergence analysis of a proximal newton method1
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- A representation of generalized convex polyhedra and applications
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- A splitting bundle approach for non-smooth non-convex minimization
- An adaptive competitive penalty method for nonsmooth constrained optimization
- Bundle method for non-convex minimization with inexact subgradients and function values
- Two-direction subgradient method for non-differentiable optimization problems
- Essentials of numerical nonsmooth optimization
- Essentials of numerical nonsmooth optimization
- Untangling of 2D meshes in ALE simulations
- A version of bundle trust region method with linear programming
- A bundle-type method for nonsmooth DC programs
- Optimal Convergence Rates for the Proximal Bundle Method
- Cutting plane oracles to minimize non-smooth non-convex functions
- Generalized-Hukuhara subdifferential analysis and its application in nonconvex composite interval optimization problems
- Multi-stage distributionally robust convex stochastic optimization with Bayesian-type ambiguity sets
- Implementation of an oracle-structured bundle method for distributed optimization
- A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- Pricing filtering in Dantzig-Wolfe decomposition
- An adaptive proximal safeguarded augmented Lagrangian method for nonsmooth DC problems with convex constraints
- Fast proximal algorithms based on Chebychev centers for nonsmooth optimization
- Synthesis of cutting and separating planes in a nonsmooth optimization method
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- A matrix generation approach for eigenvalue optimization
- Solving large-scale semidefinite programs in parallel
- A bundle modification strategy for convex minimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- A parallel interior point decomposition algorithm for block angular semidefinite programs
This page was built for publication: An aggregate subgradient method for nonsmooth convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3039046)
