On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
From MaRDI portal
Cited in
(40)- Nondifferential optimization via adaptive smoothing
- A method for minimizing the sum of a convex function and a continuously differentiable function
- Algorithms for optimization problems with exclusion constraints
- An aggregate subgradient method for nonsmooth and nonconvex minimization
- A constraint linearization method for nondifferentiable convex minimization
- Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure
- Descent methods for quasidifferentiable minimization
- An algorithm for nondifferentiable optimization
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Conditional subgradient optimization -- theory and applications
- Application of the successive relaxation method to solve extremal problems with semismooth functions
- Trajectory-following algorithms for min-max optimization problems
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- A trust region algorithm for minimization of locally Lipschitzian functions
- Stochastic approximation algorithm for minimax problems
- Outer approximation algorithm for nondifferentiable optimization problems
- Exact barrier function methods for Lipschitz programs
- On continuous codifferentiability of quasidifferentiable functions
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- An algorithm for minimizing a class of locally Lipschitz functions
- Exact penalty functions and Lagrange multipliers
- Descent methods for composite nondifferentiable optimization problems
- Exact penalty functions and stability in locally Lipschitz programming
- An application-oriented, optimization-based methodology for interactive design of engineering systems†
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- ε-Subdifferential and ε-monotonicity
- ∊-gradients pour les ponctions localements lipschitziennes et applications
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
- Exact penalization via dini and hadamard conditional derivatives
- Point-Based Set-Valued Approximations, C -Differential Operators and Applications
- Survey of Bundle Methods for Nonsmooth Optimization
- A Method for Minimization of Quasidifferentiable Functions
- Continuous approximations to generalized jacobians
- A new sequential optimality condition for constrained nonsmooth optimization
- An adaptive competitive penalty method for nonsmooth constrained optimization
- Lagrangian globalization methods for nonlinear complementarity problems
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
- On the optimal design centering, tolerancing, and tuning problem
- New constructions for local approximation of Lipschitz functions. II
This page was built for publication: On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3969459)
