Nondifferential optimization via adaptive smoothing

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Continuity and differentiation questions (26B05) Optimality conditions for free problems in two or more independent variables (49K10)

Cites Work

Stochastic approximation methods for constrained and unconstrained systems
Semismooth and Semiconvex Functions in Constrained Optimization
Optimization of lipschitz continuous functions
Generalized Gradients and Applications
Title not available (Why is that?)
Title not available (Why is that?)
On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
An Adaptive Precision Gradient Method for Optimal Control

Cited In (22)

Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
Nonsmooth optimization by Lie bracket approximations into random directions
Approximate Newton methods for nonsmooth equations
Algorithms with adaptive smoothing for finite minimax problems
On nonsmooth and discontinuous problems of stochastic systems optimization
Adaptive smoothing method, deterministically computable generalized Jacobians, and the Newton method
Solving variational inequality problems via smoothing-nonsmooth reformulations
An adaptive smoothing method for continuous minimax problems
Error stability properties of generalized gradient-type algorithms
An active set smoothing method for solving unconstrained minimax problems
On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems
Nondifferentiable optimization via smooth approximation: General analytical approach
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
Perturbed steepest-descent technique in multiextremal problems
Error bounds of two smoothing approximations for semi-infinite minimax problems
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
On the global optimization properties of finite-difference local descent algorithms
A truncated aggregate smoothing Newton method for minimax problems
Implicit smoothing and its application to optimization with piecewise smooth equality constraints
Continuous approximations to generalized jacobians
A spline smoothing Newton method for finite minimax problems

This page was built for publication: Nondifferential optimization via adaptive smoothing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053985)