A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
From MaRDI portal
Recommendations
- An adaptive gradient sampling algorithm for non-smooth optimization
- A fast gradient and function sampling method for finite-max functions
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- scientific article; zbMATH DE number 4045492
Cited in
(only showing first 100 items - show all)- Low order-value optimization and applications
- On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- Expected improvement based infill sampling for global robust optimization of constrained problems
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model
- On the local convergence analysis of the gradient sampling method for finite max-functions
- Descent algorithm for nonsmooth stochastic multiobjective optimization
- Nonsmooth spectral gradient methods for unconstrained optimization
- Quasipolynomial approach to simultaneous robust control of time-delay systems
- GradSamp
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- The noncooperative transportation problem and linear generalized Nash games
- A fast gradient and function sampling method for finite-max functions
- A convergence analysis of the method of codifferential descent
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Positive trigonometric polynomials for strong stability of difference equations
- Numerical investigation of Crouzeix's conjecture
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration
- Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks
- Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- Design of structured controllers for linear time-delay systems
- Linear system identification using the sequential stabilizing spline algorithm
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- A stochastic subgradient method for distributionally robust non-convex and non-smooth learning
- A conjugate gradient sampling method for nonsmooth optimization
- Generalized gradients in dynamic optimization, optimal control, and machine learning problems
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- An augmented subgradient method for minimizing nonsmooth DC functions
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect
- Design of delay-based output-feedback controllers optimizing a quadratic cost function via the delay Lyapunov matrix
- Non-asymptotic guarantees for sampling by stochastic gradient descent
- A proximal-projection partial bundle method for convex constrained minimax problems
- An algorithm for nonsmooth optimization by successive piecewise linearization
- Multiscale sparse microcanonical models
- Continuous outer subdifferentials in nonsmooth optimization
- Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering
- Stable als approximation in the TT-format for rank-adaptive tensor completion
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- Optimizing damper connectors for adjacent buildings
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
- A nonsmooth program for jamming hard spheres
- On solving simple bilevel programs with a nonconvex lower level program
- Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler
- Softness, sleekness and regularity properties in nonsmooth analysis
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Half-linear regularization for nonconvex image restoration models
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
- A primal nonsmooth reformulation for bilevel optimization problems
- Stochastic absolute value equations
- KSSOLV 2.0: an efficient Matlab toolbox for solving the Kohn-Sham equations with plane-wave basis set
- -subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- A subgradient method based on gradient sampling for solving convex optimization problems
- Fixed-structure robust controller design for chatter mitigation in high-speed milling
- On the differentiability check in gradient sampling methods
- Solving linear generalized Nash equilibrium problems numerically
- Subgradient and bundle methods for nonsmooth optimization
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- Comparing different nonsmooth minimization methods and software
- A class of nonlocal models for pedestrian traffic
- Subgradient and sampling algorithms for _1 regression
- A Riemannian gradient sampling algorithm for nonsmooth optimization on manifolds
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- Separation of convex sets by Clarke subdifferential
- Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- A new trust region method for nonsmooth nonconvex optimization
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A nonsmooth optimisation approach for the stabilisation of time-delay systems
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- Nonsmooth optimization via quasi-Newton methods
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- An SL/QP algorithm for minimizing the spectral abscissa of time delay systems
- Large-scale and global maximization of the distance to instability
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
- Derivative-free optimization methods for finite minimax problems
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization
- Diagonal bundle method for nonsmooth sparse optimization
- Auxiliary Gradient-Based Sampling Algorithms
- Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
- Greedy Sampling Using Nonlinear Optimization
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- A two-phase bundle method with bundle modification for nonsmooth constrained optimization
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability
This page was built for publication: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317521)
