Pages that link to "Item:Q742299"
From MaRDI portal
The following pages link to Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299):
Displayed 17 items.
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach (Q259109) (← links)
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application (Q319989) (← links)
- A class of customized proximal point algorithms for linearly constrained convex optimization (Q725706) (← links)
- A primal-dual prediction-correction algorithm for saddle point optimization (Q727398) (← links)
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization (Q779740) (← links)
- Quadratic kernel-free least squares support vector machine for target diseases classification (Q887869) (← links)
- An implementable first-order primal-dual algorithm for structured convex optimization (Q1724030) (← links)
- Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit (Q1743377) (← links)
- A parameterized proximal point algorithm for separable convex optimization (Q1800446) (← links)
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis (Q2010228) (← links)
- A double extrapolation primal-dual algorithm for saddle point problems (Q2211739) (← links)
- Robust linear neural network for constrained quadratic optimization (Q2314746) (← links)
- A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint (Q2347563) (← links)
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM (Q2398479) (← links)
- Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces (Q2419566) (← links)
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective (Q2419572) (← links)
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA (Q5963317) (← links)