Pages that link to "Item:Q3503200"

The following pages link to Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization (Q3503200):

Displaying 50 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)
• Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration (Q2057056) (← links)
• Convergence of the gradient sampling algorithm on directionally Lipschitz functions (Q2070408) (← 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)
• Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems (Q2136887) (← links)
• A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
• Non-asymptotic guarantees for sampling by stochastic gradient descent (Q2290072) (← links)
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
• On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems (Q2674587) (← links)
• Stochastic absolute value equations (Q2700136) (← 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 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)
• 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)
• A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions (Q5883328) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• Multifidelity Robust Controller Design with Gradient Sampling (Q6039252) (← links)
• Sharp global convergence guarantees for iterative nonconvex optimization with random data (Q6046308) (← links)
• A gradient sampling algorithm for stratified maps with applications to topological data analysis (Q6052059) (← links)
• A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
• New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)
• Modified gradient sampling algorithm for nonsmooth semi-infinite programming (Q6578198) (← links)
• No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians (Q6634520) (← links)