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
- Essentials of numerical nonsmooth optimization
- 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 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
- 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
- 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
- An augmented subgradient method for minimizing nonsmooth DC functions
- 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
- 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
- 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
- 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
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Subgradient and bundle methods for nonsmooth optimization
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- A two-phase bundle method with bundle modification for nonsmooth constrained optimization
- Solving maximum-entropy sampling problems using factored masks
- A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions
- Minimum density hyperplanes
- 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
- A proximal-projection partial bundle method for convex constrained minimax problems
- 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
- ROSTAPACK
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- DDE-BIFTOOL
- OLAF
- SolvOpt
- 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
- GAITA
- MORLAB
- LiPsMin
- NEP-PACK
- FMS
- fairness
- Solver-o-matic
- DaliLite
- DFO-TRNS
- SDMINMAX
- MADMM
This page was built for software: GradSamp
