scientific article; zbMATH DE number 3559294

Cited in

(74)

An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
Essentials of numerical nonsmooth optimization
Stochastic dynamic cutting plane for multistage stochastic convex programs
Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
Large-scale unit commitment under uncertainty: an updated literature survey
Regularized decomposition of large scale block-structured robust optimization problems
Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm
A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
Optimal Convergence Rates for the Proximal Bundle Method
Machine learning algorithms of relaxation subgradient method with space extension
A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
scientific article; zbMATH DE number 7656028 (Why is no real title available?)
Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
A minimization method for the sum of a convex function and a continuously differentiable function
A level-set method for convex optimization with a feasible solution path
\(\epsilon\)-subgradient projection algorithm
On the properties of the method of minimization for convex functions with relaxation on the distance to extremum
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
Essentials of numerical nonsmooth optimization
A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
A feasible point method with bundle modification for nonsmooth convex constrained optimization
The noncooperative transportation problem and linear generalized Nash games
An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
Penalty-proximal methods in convex programming
Extension of some results for channel capacity using a generalized information measure
A two-phase bundle method with bundle modification for nonsmooth constrained optimization
A bundle modification strategy for convex minimization
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley
A proximal bundle method for nonsmooth nonconvex functions with inexact information
A proximal-projection partial bundle method for convex constrained minimax problems
A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
Level-set methods for convex optimization
Fast bundle-level methods for unconstrained and ball-constrained convex optimization
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
Method of conjugate subgradients with constrained memory
On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
Synthesis of cutting and separating planes in a nonsmooth optimization method
Large-scale unit commitment under uncertainty
A single cut proximal bundle method for stochastic convex composite optimization
An approximate quasi-Newton bundle-type method for nonsmooth optimization
Proximal oracles for optimization and sampling
Descent algorithm for a class of convex nondifferentiable functions
General Hölder smooth convergence rates follow from specialized rates assuming growth bounds
On the convergence rate of the subgradient method with metric variation and its applications in neural network approximation schemes
A new nonsmooth bundle-type approach for a class of functional equations in Hilbert spaces
An optimal variant of Kelley's cutting-plane method
A version of bundle trust region method with linear programming
Hub-and-spoke network design and fleet deployment for string planning of liner shipping
Constrained nonconvex nonsmooth optimization via proximal bundle method
Implementation of an oracle-structured bundle method for distributed optimization
An algorithm for minimizing a class of locally Lipschitz functions
A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
A method for convex minimization based on translated first-order approximations
Discrete gradient method: Derivative-free method for nonsmooth optimization
A hybrid approach of bundle and Benders applied large mixed linear integer problem
On a space extension algorithm for nondifferentiable optimization
Nonmonotone bundle-type scheme for convex nonsmooth minimization
Optimization of upper semidifferentiable functions
Bimodal optimal design of vibrating plates using theory and methods of nondifferentiable optimization
Subgradient projection algorithm. II
A non-monotone conjugate subgradient type method for minimization of convex functions
Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
A new restricted memory level bundle method for constrained convex nonsmooth optimization
A multi-step doubly stabilized bundle method for nonsmooth convex optimization
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
A subgradient projection algorithm
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem
The bundle scheme for solving arbitrary eigenvalue optimizations
On the method of shortest residuals for unconstrained optimization
Asynchronous level bundle methods
A simple version of bundle method with linear programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132264)