Pages that link to "Item:Q2867436"

The following pages link to An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436):

Displaying 24 items.

• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
• An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
• A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
• Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
• A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
• A convergence analysis of the method of codifferential descent (Q1756589) (← links)
• A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
• An efficient descent method for locally Lipschitz multiobjective optimization problems (Q2031935) (← links)
• A geometric integration approach to nonsmooth, nonconvex optimisation (Q2088134) (← links)
• An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems (Q2112678) (← links)
• Limited-memory BFGS with displacement aggregation (Q2149548) (← links)
• A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
• Derivative-free robust optimization by outer approximations (Q2288189) (← links)
• On the differentiability check in gradient sampling methods (Q2829571) (← links)
• An SQP method for minimization of locally Lipschitz functions with nonlinear constraints (Q4631819) (← links)
• A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
• A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← 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)
• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)
• Manifold Sampling for $\ell_1$ Nonconvex Optimization (Q5506685) (← links)
• A note on the convergence of deterministic gradient sampling in nonsmooth optimization (Q6498411) (← links)