An adaptive competitive penalty method for nonsmooth constrained optimization
From MaRDI portal
Publication:526728
DOI10.1007/S11075-016-0208-6zbMATH Open1372.65180OpenAlexW2531701123MaRDI QIDQ526728FDOQ526728
Authors: 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
Recommendations
- An adaptive penalty method for inequality constrained minimization problems
- Adaptive penalty method for limit variational inequalities
- A self-adaptive penalty approach for nonlinear programming.
- Convergence of an adaptive penalty scheme for finding constrained equilibria
- A penalty derivative-free algorithm for nonlinear constrained optimization
- Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization
- Penalty methods for a class of non-Lipschitz optimization problems
- An adaptive primal-dual framework for nonsmooth convex minimization
- A modified exact smooth penalty function for nonlinear constrained optimization
- A smoothing exact penalty function algorithm for nonlinear constrained optimization problems
conjugate gradientnonsmooth optimizationpenalty functionconstrained problemglobal subdifferentialGoldstein subdifferential
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- On the Convergence of a New Conjugate Gradient Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- A bundle-Newton method for nonsmooth unconstrained minimization
- Methods of descent for nondifferentiable optimization
- An aggregate subgradient method for nonsmooth convex minimization
- Theory and applications of robust optimization
- A quasisecant method for minimizing nonsmooth functions
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Nonsmooth optimization via quasi-Newton methods
- Feasible direction interior-point technique for nonlinear optimization
- Continuous subdifferential approximations and their applications
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Optimization of lipschitz continuous functions
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- Exact penalty functions and stability in locally Lipschitz programming
- Conjugate Gradient Methods with Inexact Searches
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- A splitting bundle approach for non-smooth non-convex minimization
- 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
Cited In (3)
Uses Software
This page was built for publication: An adaptive competitive penalty method for nonsmooth constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526728)
