Pages that link to "Item:Q5214248"
From MaRDI portal
The following pages link to Convergence guarantees for a class of non-convex and non-smooth optimization problems (Q5214248):
Displaying 13 items.
- Data clustering based on the modified relaxation Cheeger cut model (Q2115038) (← links)
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
- Convergence of a non-interior smoothing method for variational inequality problems (Q2511106) (← links)
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization (Q4620420) (← links)
- On the Convergence of an Optimization Algorithm Based on Nonlinear Operators (Q5164930) (← links)
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods (Q5210513) (← links)
- Sharp global convergence guarantees for iterative nonconvex optimization with random data (Q6046308) (← links)
- Stochastic approximation with discontinuous dynamics, differential inclusions, and applications (Q6103982) (← links)
- Conditional gradient and bisection algorithms for non-convex optimization problem with random perturbation (Q6106813) (← links)
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems (Q6157998) (← links)
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search (Q6568924) (← links)
- A generalized formulation for group selection via ADMM (Q6571367) (← links)
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)
