Pages that link to "Item:Q378104"
From MaRDI portal
The following pages link to Sparse solutions to random standard quadratic optimization problems (Q378104):
Displaying 12 items.
- Building a completely positive factorization (Q1787912) (← links)
- Fast algorithms for sparse portfolio selection considering industries and investment styles (Q2022191) (← links)
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems (Q2026713) (← links)
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems (Q2067857) (← links)
- Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
- On sparsity of the solution to a random quadratic optimization problem (Q2227539) (← links)
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems (Q2419543) (← links)
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980) (← links)
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions (Q3449456) (← links)
- On random quadratic forms: supports of potential local maxima (Q4611273) (← links)
- The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem (Q5219559) (← links)
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems (Q6064055) (← links)
