Pages that link to "Item:Q5317521"
From MaRDI portal
The following pages link to A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization (Q5317521):
Displaying 50 items.
- GradSamp (Q17410) (← links)
- Half-linear regularization for nonconvex image restoration models (Q255993) (← links)
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds (Q273664) (← links)
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems (Q313316) (← links)
- A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
- Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization (Q494677) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
- Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems (Q645544) (← links)
- Multivariable robust control for a 500W self-humidified PEMFC system (Q647206) (← links)
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions (Q654068) (← links)
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems (Q695344) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- A smoothing augmented Lagrangian method for solving simple bilevel programs (Q742311) (← links)
- A discussion on variational analysis in derivative-free optimization (Q829491) (← links)
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
- Stability analysis of systems with stochastically varying delays (Q847133) (← links)
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
- Solving maximum-entropy sampling problems using factored masks (Q868455) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
- Low order-value optimization and applications (Q1029662) (← links)
- On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians (Q1626525) (← links)
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints (Q1626527) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model (Q1680972) (← links)
- On the local convergence analysis of the gradient sampling method for finite max-functions (Q1682976) (← links)
- Descent algorithm for nonsmooth stochastic multiobjective optimization (Q1687314) (← links)
- Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
- Quasipolynomial approach to simultaneous robust control of time-delay systems (Q1719413) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- The noncooperative transportation problem and linear generalized Nash games (Q1754116) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- A convergence analysis of the method of codifferential descent (Q1756589) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- Positive trigonometric polynomials for strong stability of difference equations (Q1937504) (← links)
- Numerical investigation of Crouzeix's conjecture (Q2002781) (← links)
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
- An efficient descent method for locally Lipschitz multiobjective optimization problems (Q2031935) (← links)
- Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration (Q2057056) (← links)
- Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks (Q2058689) (← 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)
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty (Q2071422) (← links)
