Pages that link to "Item:Q3544264"
From MaRDI portal
The following pages link to Exact Regularization of Convex Programs (Q3544264):
Displaying 36 items.
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization (Q368088) (← links)
- Matrix-free interior point method (Q429480) (← links)
- Lagrangian-penalization algorithm for constrained optimization and variational inequalities (Q452269) (← links)
- A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
- Lagrange multipliers, (exact) regularization and error bounds for monotone variational inequalities (Q507339) (← links)
- Inexact accelerated augmented Lagrangian methods (Q887168) (← links)
- Parameter estimation with expected and residual-at-risk criteria (Q999831) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
- Error forgetting of Bregman iteration (Q1945369) (← links)
- Accelerated linearized Bregman method (Q1945379) (← links)
- Lagrangian duality and saddle points for sparse linear programming (Q2010427) (← links)
- The Tikhonov regularization for vector equilibrium problems (Q2028472) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- From simple structure to sparse components: a review (Q2259727) (← links)
- Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces (Q2337146) (← links)
- Local linear convergence of a primal-dual algorithm for the augmented convex models (Q2399239) (← links)
- The modified accelerated Bregman method for regularized basis pursuit problem (Q2405606) (← links)
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming (Q2420822) (← links)
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils (Q2666658) (← links)
- An exact penalty approach for optimization with nonnegative orthogonality constraints (Q2687065) (← links)
- Regularization of vector equilibrium problems (Q2693791) (← links)
- On the Convergence of Decentralized Gradient Descent (Q2821798) (← links)
- Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming (Q2956394) (← links)
- Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging (Q3188209) (← links)
- Sparse Approximations with Interior Point Methods (Q5044994) (← links)
- On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis (Q5107212) (← links)
- An $L^1$ Penalty Method for General Obstacle Problems (Q5264051) (← links)
- A time continuation based fast approximate algorithm for compressed sensing related optimization (Q5501146) (← links)
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems (Q5741071) (← links)
- Linear programming with nonparametric penalty programs and iterated thresholding (Q5882227) (← links)
- Faster randomized block sparse Kaczmarz by averaging (Q6109882) (← links)
- Non-crossing convex quantile regression (Q6117827) (← links)
