GradSamp

swMATH5270MaRDI QIDQ17410FDOQ17410

Author name not available (Why is that?)

Official website: http://www.cs.nyu.edu/faculty/overton/papers/gradsamp/index.html

Described by source

• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization

Cited In (only showing first 100 items - show all)

• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
• Spectrum-based stability analysis and stabilization of time-periodic time-delay systems
• Half-linear regularization for nonconvex image restoration models
• An efficient descent method for locally Lipschitz multiobjective optimization problems
• On solving simple bilevel programs with a nonconvex lower level program
• Nonsmooth optimization via quasi-Newton methods
• An extension of the quasi-Newton method for minimizing locally Lipschitz functions
• Codifferential method for minimizing nonsmooth DC functions
• \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
• Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler
• Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems
• A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions
• Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
• Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
• A derivative-free approximate gradient sampling algorithm for finite minimax problems
• On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
• Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
• Softness, sleekness and regularity properties in nonsmooth analysis
• OLAF
• NDA
• PLCP
• UFO
• HIFOO
• HANSO
• SLQP-GS
• NSO
• SQPlab
• DGM
• PBNCGC
• PNEW
• QSM
• amodMC
• LDGB
• Polynomial Toolbox
• QPmR
• CARTopt
• MPBNGC
• DPA_TDEFL
• QDPA
• TRACE-DDE
• Packmol
• JSR
• tvreg
• A Riemannian subgradient algorithm for economic dispatch with valve-point effect
• Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
• GAITA
• MORLAB
• LiPsMin
• NEP-PACK
• FMS
• fairness
• Solver-o-matic
• A class of nonlocal models for pedestrian traffic
• DaliLite
• DFO-TRNS
• SDMINMAX
• MADMM
• PIETOOLS
• GRANSO
• StabilityStabilizationPTDS
• BOLIB
• Derivative-free optimization methods for finite minimax problems
• A smoothing augmented Lagrangian method for solving simple bilevel programs
• Piecewise linear approximations in nonconvex nonsmooth optimization
• Controller Design via Nonsmooth Multidirectional Search
• Subsampling algorithms for semidefinite programming
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• A quasisecant method for minimizing nonsmooth functions
• Multivariable robust control for a 500W self-humidified PEMFC system
• A note on the smoothing quadratic regularization method for non-Lipschitz optimization
• Diagonal bundle method for nonsmooth sparse optimization
• A direct search quasi-Newton method for nonsmooth unconstrained optimization
• An algorithm for nonsmooth optimization by successive piecewise linearization
• Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
• Variational Analysis and Generalized Differentiation I
• GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
• Low order-value optimization and applications
• Smoothing methods for nonsmooth, nonconvex minimization
• Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
• An adaptive competitive penalty method for nonsmooth constrained optimization
• Multiscale sparse microcanonical models
• Stable als approximation in the TT-format for rank-adaptive tensor completion
• A new trust region method for nonsmooth nonconvex optimization
• Design of structured controllers for linear time-delay systems
• Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
• A discussion on variational analysis in derivative-free optimization
• A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
• A nonsmooth optimisation approach for the stabilisation of time-delay systems
• 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
• 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 augmented subgradient method for minimizing nonsmooth DC functions
• Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems

This page was built for software: GradSamp