The Minimization of Semicontinuous Functions: Mollifier Subgradients
From MaRDI portal
(Redirected from Publication:4763543)
Recommendations
Cited in
(46)- A stochastic gradient type algorithm for closed-loop problems
- On nonsmooth and discontinuous problems of stochastic systems optimization
- Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization
- Main directions in the development of informatics
- Challenges in stochastic programming
- Two-level iterative method for non-stationary mixed variational inequalities
- Mean value theorem for continuous vector functions by smooth approximations.
- Almost everywhere convex functions on \(\mathbb R^n\) and weak derivatives
- Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
- Robustness and averaging properties of a large-amplitude, high-frequency extremum seeking control scheme
- Perturbed iterate SGD for Lipschitz continuous loss functions
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
- Modified Jacobian smoothing method for nonsmooth complementarity problems
- Steklov regularization and trajectory methods for univariate global optimization
- Selective bi-coordinate method for limit non-smooth resource allocation type problems
- Global optimization of bounded factorable functions with discontinuities
- Second-order mollified derivatives and optimization
- On the computation of equilibria in monotone and potential stochastic hierarchical games
- A characterization of almost everywhere convex functions
- Minimization of semicoercive functions: a generalization of Fichera's existence theorem for the Signorini problem
- Optimization and second-order derivatives for a Lipschitz function
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- scientific article; zbMATH DE number 19761 (Why is no real title available?)
- Gradient-based simulation optimization under probability constraints
- Bias reduction in sample-based optimization
- Necessary conditions for adverse control problems expressed by relaxed derivatives
- Pathological subgradient dynamics
- Analytic approximation and differentiability of joint chance constraints
- An inner-outer approximation approach to chance constrained optimization
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- scientific article; zbMATH DE number 7733444 (Why is no real title available?)
- Consistent approximations in composite optimization
- Extrapolated hard thresholding algorithms with finite length for composite _0 penalized problems
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- Central limit theorems for vector-valued composite functionals with smoothing and applications
- Portfolio reshaping under 1st-order stochastic dominance constraints by the exact penalty function methods
- Zeroth-order gradient and quasi-Newton methods for nonsmooth nonconvex stochastic optimization
- The gradient's limit of a definable family of functions admits a variational stratification
- Non-cooperative games with minmax objectives
- Simultaneous perturbation stochastic approximation of nonsmooth functions
- Optimal and suboptimal solutions to stochastically uncertain problems of quintile optimization
- Smoothing by mollifiers. II: Nonlinear optimization
- Smoothing by mollifiers. I: Semi-infinite optimization
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
This page was built for publication: The Minimization of Semicontinuous Functions: Mollifier Subgradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763543)
