The following pages link to Shu-Zhong Zhang (Q888302):
Displaying 50 items.
- (Q237883) (redirect page) (← links)
- On distributional robust probability functions and their computations (Q297175) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity (Q334319) (← links)
- Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- On optimal low rank Tucker approximation for tensors: the case for an adjustable core size (Q496606) (← links)
- An extragradient-based alternating direction method for convex minimization (Q525598) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- New results on Hermitian matrix rank-one decomposition (Q543410) (← links)
- A nonconvergent example for the iterative water-filling algorithm (Q550516) (← links)
- A new self-dual embedding method for convex programming (Q557368) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← links)
- A note on a stochastic location problem (Q688208) (← links)
- Approximation methods for complex polynomial optimization (Q742305) (← links)
- On the sublinear convergence rate of multi-block ADMM (Q888303) (← links)
- Approximation algorithm for facility location with service installation costs (Q924885) (← links)
- A \({\mathsf{D}}\)-induced duality and its applications (Q925269) (← links)
- Robust portfolio selection based on a multi-stage scenario tree (Q932207) (← links)
- On anti-cycling pivoting rules for the simplex method (Q1178727) (← links)
- On the long-step path-following method for semidefinite programming (Q1273093) (← links)
- An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
- Sequencing jobs that require common resources on a single machine: A solvable case of the TSP (Q1290645) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) (← links)
- On extensions of the Frank-Wolfe theorems (Q1294820) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems (Q1335125) (← links)
- The teachings of Hua Loo-Keng: A challenge today? (Q1345649) (← links)
- Quadratic maximization and semidefinite relaxation (Q1575069) (← links)
- On weighted centers for semidefinite programming (Q1584796) (← links)
- New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) (← links)
- Global convergence of unmodified 3-block ADMM for a class of convex minimization problems (Q1668709) (← links)
- On the information-adaptive variants of the ADMM: an iteration complexity perspective (Q1668725) (← links)
- First-order algorithms for convex optimization with nonseparable objective and coupled constraints (Q1706676) (← links)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization (Q1753069) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- New complexity results for the Iri-Imai method (Q1915925) (← links)
- A new algorithm for generalized fractional programs (Q1919091) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- Using duality to solve generalized fractional programming problems (Q1924069) (← links)
- Robust arbitrage conditions for financial markets (Q1981932) (← links)
- Tight bounds for a class of data-driven distributionally robust risk measures (Q2115129) (← links)
- Cubic regularized Newton method for the saddle point models: a global and local convergence analysis (Q2148117) (← links)
- On lower iteration complexity bounds for the convex concave saddle point problems (Q2149573) (← links)
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis (Q2205985) (← links)
- Randomized primal-dual proximal block coordinate updates (Q2314059) (← links)
