GradSamp

swMATH5270MaRDI QIDQ17410FDOQ17410

Author name not available (Why is that?)

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
• Multiscale sparse microcanonical models
• Stable als approximation in the TT-format for rank-adaptive tensor completion
• An efficient descent method for locally Lipschitz multiobjective optimization problems
• On solving simple bilevel programs with a nonconvex lower level program
• A discussion on variational analysis in derivative-free optimization
• A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
• Nonsmooth optimization via quasi-Newton methods
• A nonsmooth optimisation approach for the stabilisation of time-delay systems
• An extension of the quasi-Newton method for minimizing locally Lipschitz functions
• An Approximation Scheme for Distributionally Robust Nonlinear Optimization
• 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
• 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
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
• A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
• On the local convergence analysis of the gradient sampling method for finite max-functions
• A fast gradient and function sampling method for finite-max functions
• An SL/QP algorithm for minimizing the spectral abscissa of time delay systems
• 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
• Subgradient and bundle methods for nonsmooth optimization
• Solving maximum-entropy sampling problems using factored masks
• 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
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
• A Riemannian subgradient algorithm for economic dispatch with valve-point effect
• Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
• Manifold sampling for \(\ell_1\) nonconvex optimization
• A class of nonlocal models for pedestrian traffic
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
• 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
• Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
• A direct search quasi-Newton method for nonsmooth unconstrained optimization
• An algorithm for nonsmooth optimization by successive piecewise linearization
• A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
• On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians
• Relax-and-split method for nonconvex inverse problems
• Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
• Variational Analysis and Generalized Differentiation I
• GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
• A conjugate gradient sampling method for nonsmooth optimization
• Low order-value optimization and applications
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
• Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
• Fixed-structure robust controller design for chatter mitigation in high-speed milling
• 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
• 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
• Continuous outer subdifferentials in nonsmooth optimization
• Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering
• Pathological subgradient dynamics
• A nonsmooth program for jamming hard spheres
• A new sequential optimality condition for constrained nonsmooth optimization
• Interpolation of functions with parameter dependent jumps by transformed snapshots
• Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
• An augmented subgradient method for minimizing nonsmooth DC functions
• Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
• Linear system identification using the sequential stabilizing spline algorithm
• An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
• Essentials of numerical nonsmooth optimization
• A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
• A feasible point method with bundle modification for nonsmooth convex constrained optimization
• A gradient sampling method on algebraic varieties and application to nonsmooth low-rank optimization
• A two-phase bundle method with bundle modification for nonsmooth constrained 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
• Minimum density hyperplanes
• Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
• A proximal-projection partial bundle method for convex constrained minimax problems
• Generalized gradients in dynamic optimization, optimal control, and machine learning problems
• Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
• Large-scale and global maximization of the distance to instability
• Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis

This page was built for software: GradSamp