Pages that link to "Item:Q5387987"
From MaRDI portal
The following pages link to A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization (Q5387987):
Displaying 8 items.
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems (Q2082554) (← links)
- Nonconvex proximal incremental aggregated gradient method with linear convergence (Q2275279) (← links)
- A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization (Q2691343) (← links)
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980) (← links)
- (Q3346104) (← links)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS (Q3560109) (← links)
- Efficient min–max MPC: Achieving a large domain of attraction with short horizon (Q6154587) (← links)
