An adaptive competitive penalty method for nonsmooth constrained optimization
From MaRDI portal
Publication:526728
DOI10.1007/s11075-016-0208-6zbMath1372.65180OpenAlexW2531701123MaRDI QIDQ526728
Nezam Mahdavi-Amiri, M. Shaeiri
Publication date: 15 May 2017
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-016-0208-6
nonsmooth optimizationpenalty functionconjugate gradientconstrained problemglobal subdifferentialGoldstein subdifferential
Related Items
Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions, An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonsmooth optimization via quasi-Newton methods
- Proximity control in bundle methods for convex nondifferentiable minimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Feasible direction interior-point technique for nonlinear optimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Continuous subdifferential approximations and their applications
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Methods of descent for nondifferentiable optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- An aggregate subgradient method for nonsmooth convex minimization
- Theory and Applications of Robust Optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A quasisecant method for minimizing nonsmooth functions
- Optimization and nonsmooth analysis
- Exact penalty functions and stability in locally Lipschitz programming
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Optimally conditioned optimization algorithms without line searches
- Optimization of lipschitz continuous functions
- An Algorithm for Constrained Optimization with Semismooth Functions
- Conjugate Gradient Methods with Inexact Searches
- On the Convergence of a New Conjugate Gradient Algorithm
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- A splitting bundle approach for non-smooth non-convex minimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Benchmarking optimization software with performance profiles.
