Pages that link to "Item:Q3503200"
From MaRDI portal
The following pages link to Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization (Q3503200):
Displayed 34 items.
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- On the local convergence analysis of the gradient sampling method for finite max-functions (Q1682976) (← links)
- Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- Numerical investigation of Crouzeix's conjecture (Q2002781) (← links)
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions (Q2070408) (← links)
- A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- On the differentiability check in gradient sampling methods (Q2829571) (← links)
- An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436) (← links)
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds (Q2967606) (← links)
- A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← links)
- Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- A New Sequential Optimality Condition for Constrained Nonsmooth Optimization (Q5114399) (← links)
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities (Q5116553) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions (Q5210738) (← links)
- A Gradient Sampling Method on Algebraic Varieties and Application to Nonsmooth Low-Rank Optimization (Q5242934) (← links)
- A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles (Q5268896) (← links)
- Manifold Sampling for $\ell_1$ Nonconvex Optimization (Q5506685) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)