Pages that link to "Item:Q5704097"

The following pages link to Approximating Subdifferentials by Random Sampling of Gradients (Q5704097):

Displaying 36 items.

• \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds (Q273664) (← links)
• Semi-algebraic functions have small subdifferentials (Q359626) (← links)
• A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
• The dimension of semialgebraic subdifferential graphs (Q654064) (← links)
• On Nesterov's nonsmooth Chebyshev-Rosenbrock functions (Q654068) (← links)
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
• A note on an approximate Lagrange multiplier rule (Q849326) (← links)
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
• Two numerical methods for optimizing matrix stability (Q1611899) (← links)
• Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints (Q1626527) (← links)
• Descent algorithm for nonsmooth stochastic multiobjective optimization (Q1687314) (← links)
• Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
• A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
• Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study (Q2070327) (← links)
• Convergence of the gradient sampling algorithm on directionally Lipschitz functions (Q2070408) (← links)
• Perturbed iterate SGD for Lipschitz continuous loss functions (Q2093279) (← links)
• An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems (Q2112678) (← links)
• Spectral radius minimization for optimal average consensus and output feedback stabilization (Q2391321) (← links)
• Softness, sleekness and regularity properties in nonsmooth analysis (Q2482485) (← links)
• On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems (Q2674587) (← links)
• Spectral projected subgradient method for nonsmooth convex optimization problems (Q2700023) (← links)
• A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
• On the differentiability check in gradient sampling methods (Q2829571) (← links)
• An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436) (← links)
• On the nondifferentiability of cone-monotone functions in Banach spaces (Q3407608) (← links)
• A nonsmooth optimisation approach for the stabilisation of time-delay systems (Q3516870) (← links)
• Differentiability of cone-monotone functions on separable Banach space (Q4452196) (← links)
• Derivative-free optimization methods for finite minimax problems (Q4924116) (← links)
• Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability (Q5059142) (← links)
• A New Sequential Optimality Condition for Constrained Nonsmooth Optimization (Q5114399) (← links)
• Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
• Subsampling Algorithms for Semidefinite Programming (Q5168846) (← links)
• A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
• Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions (Q5252223) (← links)
• An Improved Unconstrained Approach for Bilevel Optimization (Q6076870) (← links)
• A note on the convergence of deterministic gradient sampling in nonsmooth optimization (Q6498411) (← links)