The following pages link to Yin Zhang (Q520188):
Displayed 50 items.
- Item:Q520188 (redirect page) (← links)
- Item:Q213738 (redirect page) (← links)
- Item:Q520188 (redirect page) (← links)
- Subspace methods with local refinements for eigenvalue computation using low-rank tensor-train format (Q520189) (← links)
- An alternating direction algorithm for matrix completion with nonnegative factors (Q693195) (← links)
- Comparison of two sets of first-order conditions as bases of interior-point Newton methods for optimization with simple bounds (Q700699) (← links)
- Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming. (Q703159) (← links)
- Interior-point gradient method for large-scale totally nonnegative least squares problems (Q813389) (← links)
- Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
- General robust-optimization formulation for nonlinear programming (Q995951) (← links)
- The contraction number of a multigrid method with mesh ratio two for solving model problems (Q1087322) (← links)
- A new quasi-Newton algorithm (Q1095608) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization (Q1194859) (← links)
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming (Q1290605) (← links)
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (Q1321176) (← links)
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (Q1321337) (← links)
- Modified predictor-corrector algorithm for locating weighted centers in linear programming (Q1321467) (← links)
- Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141) (← links)
- Maximum stable set formulations and heuristics based on continuous optimization (Q1396818) (← links)
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs (Q1411645) (← links)
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation (Q1610312) (← links)
- An alternating direction and projection algorithm for structure-enforced matrix factorization (Q1687315) (← links)
- Foreword: Special issue on mathematical programming in biology and medicine (Q1764227) (← links)
- A global optimization method for the molecular replacement problem in X-ray crystallography (Q1780962) (← links)
- On the convergence of the iteration sequence in primal-dual interior- point methods (Q1804356) (← links)
- On the convergence rate of Newton interior-point methods in the absence of strict complementarity (Q1816402) (← links)
- On convergence of minimization methods: Attraction, repulsion, and selection (Q1841569) (← links)
- Solving a class of semidefinite programs via nonlinear programming (Q1849262) (← links)
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928) (← links)
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
- On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
- A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← links)
- Local linear convergence of an ADMM-type splitting framework for equality constrained optimization (Q2240104) (← links)
- Convergence of a class of stationary iterative methods for saddle point problems (Q2314058) (← links)
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
- Trace-penalty minimization for large-scale eigenspace computation (Q2398478) (← links)
- Case studies for a first-order robust nonlinear programming formulation (Q2454739) (← links)
- Dose-volume-based IMRT fluence optimization: a fast least-squares approach with differentia\-bility (Q2472382) (← links)
- An efficient augmented Lagrangian method with applications to total variation minimization (Q2636603) (← links)
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs (Q2784422) (← links)
- Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions (Q2847729) (← links)
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation (Q2998011) (← links)
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments (Q3071331) (← links)
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing (Q3095057) (← links)
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction (Q3183365) (← links)
- A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration (Q3183398) (← links)
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence (Q3395007) (← links)
- (Q3493073) (← links)
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise (Q3581071) (← links)