The following pages link to Wotao Yin (Q256033):
Displaying 50 items.
- A feasible method for optimization with orthogonality constraints (Q101635) (← links)
- Parallel matrix factorization for low-rank tensor completion (Q256035) (← links)
- (Q326396) (redirect page) (← links)
- A fast patch-dictionary method for whole image recovery (Q326397) (← links)
- (Q425396) (redirect page) (← links)
- Copula density estimation by total variation penalized likelihood with linear equality constraints (Q425397) (← links)
- Folding-free global conformal mapping for genus-0 surfaces by harmonic energy minimization (Q461251) (← links)
- (Q479903) (redirect page) (← links)
- Learning circulant sensing kernels (Q479905) (← links)
- Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
- A three-operator splitting scheme and its optimization applications (Q683303) (← links)
- An alternating direction algorithm for matrix completion with nonnegative factors (Q693195) (← links)
- Sparse recovery via differential inclusions (Q739470) (← links)
- Fast linearized Bregman iteration for compressive sensing and sparse denoising (Q973207) (← links)
- On unbounded delays in asynchronous parallel fixed-point algorithms (Q1668724) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- Coordinate-friendly structures, algorithms and applications (Q1690621) (← links)
- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems (Q1691386) (← links)
- Parallel multi-block ADMM with \(o(1/k)\) convergence (Q1704845) (← links)
- Global convergence of ADMM in nonconvex nonsmooth optimization (Q1736880) (← links)
- Cauchy noise removal by nonconvex ADMM with convergence guarantees (Q1742663) (← links)
- A parallel method for earth mover's distance (Q1747622) (← links)
- Parallel redistancing using the Hopf-Lax formula (Q1783414) (← links)
- Algorithm for overcoming the curse of dimensionality for certain non-convex Hamilton-Jacobi equations, projections and differential games (Q1797853) (← links)
- Error forgetting of Bregman iteration (Q1945369) (← links)
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← links)
- Acceleration of primal-dual methods by preconditioning and simple subproblem procedures (Q2027970) (← links)
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
- Feasibility-based fixed point networks (Q2138454) (← links)
- A multiscale semi-smooth Newton method for optimal transport (Q2144980) (← links)
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints (Q2148118) (← links)
- A mean field game inverse problem (Q2149026) (← links)
- Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry (Q2149561) (← links)
- A one-bit, comparison-based gradient estimator (Q2155805) (← links)
- Tight coefficients of averaged operators via scaled relative graph (Q2190023) (← links)
- Algorithm for overcoming the curse of dimensionality for state-dependent Hamilton-Jacobi equations (Q2220578) (← links)
- A dual algorithm for a class of augmented convex signal recovery models (Q2257625) (← links)
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650) (← links)
- Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
- Markov chain block coordinate descent (Q2301127) (← links)
- Algorithm for Hamilton-Jacobi equations in density space via a generalized Hopf formula (Q2316263) (← links)
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations (Q2374380) (← links)
- On the global and linear convergence of the generalized alternating direction method of multipliers (Q2398464) (← links)
- An envelope for Davis-Yin splitting and strict saddle-point avoidance (Q2420798) (← links)
- On the convergence of asynchronous parallel iteration with unbounded delays (Q2422607) (← links)
- Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers (Q2425163) (← links)
- Slope and \(G\)-set characterization of set-valued functions and applications to non-differentiable optimization problems (Q2493369) (← links)
- An efficient augmented Lagrangian method with applications to total variation minimization (Q2636603) (← links)
- ARock: an algorithmic framework for asynchronous parallel coordinate updates (Q2821779) (← links)
