An adaptive competitive penalty method for nonsmooth constrained optimization
From MaRDI portal
(Redirected from Publication:526728)
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
Cites work
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 3439906 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A bundle-Newton method for nonsmooth unconstrained minimization
- A quasisecant method for minimizing nonsmooth functions
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A splitting bundle approach for non-smooth non-convex minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- An adaptive gradient sampling algorithm for non-smooth optimization
- An aggregate subgradient method for nonsmooth convex minimization
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Benchmarking optimization software with performance profiles.
- Conjugate Gradient Methods with Inexact Searches
- Continuous subdifferential approximations and their applications
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Exact penalty functions and stability in locally Lipschitz programming
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Feasible direction interior-point technique for nonlinear optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Methods of descent for nondifferentiable optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Nonsmooth optimization via quasi-Newton methods
- On the Convergence of a New Conjugate Gradient Algorithm
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Optimally conditioned optimization algorithms without line searches
- Optimization and nonsmooth analysis
- Optimization of lipschitz continuous functions
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Theory and applications of robust optimization
Cited in
(3)
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)
