Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
From MaRDI portal
Publication:5860819
DOI10.1080/02331934.2020.1777124zbMath1480.90201OpenAlexW3035165643MaRDI QIDQ5860819
Mustapha El Moudden, Ahmed El Ghali
Publication date: 23 November 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1777124
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Stochastic perturbation of reduced gradient \& GRG methods for nonconvex programming problems
- Optimization of upper semidifferentiable functions
- Proximity control in bundle methods for convex nondifferentiable minimization
- Linear and nonlinear programming.
- An implementation of Shor's \(r\)-algorithm
- Bundle trust-region algorithm for bilinear bilevel programming
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation
- Quasidifferentiability and nonsmooth modelling in mechanics, engineering and economics
- Methods of descent for nondifferentiable optimization
- A derivative-free method for linearly constrained nonsmooth optimization
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- Introduction to Nonsmooth Optimization
- A reduced subgradient algorithm
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- A modified reduced gradient method for a class of nondifferentiable problems
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Linearly constrained minimax optimization
- Sur quelques méthodes de gradient réduit sous contraintes linéaires
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Survey of Bundle Methods for Nonsmooth Optimization
- A splitting bundle approach for non-smooth non-convex minimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Convex Analysis
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
