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)- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Half-linear regularization for nonconvex image restoration models
- An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
- Essentials of numerical nonsmooth optimization
- An implementable descent method for nonsmooth multiobjective optimization on Riemannian manifolds
- Non-asymptotic guarantees for sampling by stochastic gradient descent
- Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential
- Leveraging randomized smoothing for optimal control of nonsmooth dynamical systems
- Multiscale sparse microcanonical models
- Spectrum-based stability analysis and stabilization of time-periodic time-delay systems
- Stable als approximation in the TT-format for rank-adaptive tensor completion
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Design of structured controllers for linear time-delay systems
- A discussion on variational analysis in derivative-free optimization
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A new trust region method for nonsmooth nonconvex optimization
- On solving simple bilevel programs with a nonconvex lower level program
- Continuous outer subdifferentials in nonsmooth optimization
- Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering
- Nonsmooth optimization via quasi-Newton methods
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- An optimization algorithm for \(\mathcal{H}_\infty\) control of linear delay systems
- A nonsmooth program for jamming hard spheres
- A nonsmooth optimisation approach for the stabilisation of time-delay systems
- Codifferential method for minimizing nonsmooth DC functions
- Pathological subgradient dynamics
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- -subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- A new sequential optimality condition for constrained nonsmooth optimization
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Interpolation of functions with parameter dependent jumps by transformed snapshots
- Modified gradient sampling algorithm for nonsmooth semi-infinite programming
- Bundle trust region algorithm based on linear subproblem
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
- Stability analysis of systems with stochastically varying delays
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- An augmented subgradient method for minimizing nonsmooth DC functions
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- Linear system identification using the sequential stabilizing spline algorithm
- SOBMOR: Structured Optimization-Based Model Order Reduction
- On the local convergence analysis of the gradient sampling method for finite max-functions
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- A fast gradient and function sampling method for finite-max functions
- Essentials of numerical nonsmooth optimization
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- The noncooperative transportation problem and linear generalized Nash games
- Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler
- An SL/QP algorithm for minimizing the spectral abscissa of time delay systems
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- A constraint dissolving approach for nonsmooth optimization over the Stiefel manifold
- Greedy Sampling Using Nonlinear Optimization
- A gradient sampling method on algebraic varieties and application to nonsmooth low-rank optimization
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- A convergence analysis of the method of codifferential descent
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- Subgradient and bundle methods for nonsmooth optimization
- A two-phase bundle method with bundle modification for nonsmooth constrained optimization
- Solving maximum-entropy sampling problems using factored masks
- Making individually fair predictions with causal pathways
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Separation of convex sets by Clarke subdifferential
- The chain rule for VU-decompositions of nonsmooth functions
- A proximal-projection partial bundle method for convex constrained minimax problems
- Subgradient and sampling algorithms for _1 regression
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
- Generalized gradients in dynamic optimization, optimal control, and machine learning problems
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- Zeroth-order gradient and quasi-Newton methods for nonsmooth nonconvex stochastic optimization
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- GradSamp
- Solving linear generalized Nash equilibrium problems numerically
- Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
- A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
- Softness, sleekness and regularity properties in nonsmooth analysis
- A stochastic subgradient method for distributionally robust non-convex and non-smooth learning
- Large-scale and global maximization of the distance to instability
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis
- An adaptive gradient sampling algorithm for non-smooth optimization
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect
- Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
- Nonsmooth spectral gradient methods for unconstrained optimization
- A hierarchy of spectral relaxations for polynomial optimization
- Design of delay-based output-feedback controllers optimizing a quadratic cost function via the delay Lyapunov matrix
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
- Bregman distance regularization for nonsmooth and nonconvex optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- Comparing different nonsmooth minimization methods and software
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)
