The following pages link to Zhi-Quan Luo (Q230689):
Displaying 50 items.
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks (Q301668) (← links)
- (Q457539) (redirect page) (← links)
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
- (Q489107) (redirect page) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- A nonconvergent example for the iterative water-filling algorithm (Q550516) (← links)
- (Q589146) (redirect page) (← links)
- A Stackelberg game approach to distributed spectrum management (Q644909) (← links)
- A decomposition property for a class of square matrices (Q810110) (← links)
- Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines (Q871431) (← links)
- Communication complexity of convex optimization (Q1100896) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- On a global error bound for a class of monotone affine variational inequality problems (Q1197896) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- On extensions of the Frank-Wolfe theorems (Q1294820) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- A modified predictor-corrector method for linear programming (Q1318279) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- One-way communication complexity of computing a collection of rational functions (Q1333237) (← links)
- Error bounds for analytic systems and their applications (Q1340064) (← links)
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints (Q1383834) (← links)
- Approximation algorithms for quadratic programming (Q1386484) (← links)
- Predictor-corrector method for nonlinear complementarity problems (Q1387608) (← links)
- Computational complexity of a problem arising in fixed order output feedback design (Q1391595) (← links)
- Applications of convex optimization in signal processing and digital communication (Q1403287) (← links)
- On blind source separation using mutual information criterion (Q1403306) (← links)
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities (Q1567481) (← links)
- New error bounds and their applications to convergence analysis of iterative algorithms (Q1584006) (← links)
- Optimal estimation of sensor biases for asynchronous multi-sensor data fusion (Q1650785) (← links)
- (Q1891431) (redirect page) (← links)
- On the computational complexity of the maximum trade problem (Q1891433) (← links)
- A distributed method for optimal capacity reservation (Q2322374) (← links)
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints (Q2365344) (← links)
- A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems (Q2425182) (← links)
- Minimum energy decentralized estimation in a wireless sensor network with correlated sensor noises (Q2501751) (← links)
- Smoothing Functions for Second-Order-Cone Complementarity Problems (Q2784419) (← links)
- Robust Filtering via Semidefinite Programming with Applications to Target Tracking (Q2784434) (← links)
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization (Q2848188) (← links)
- Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs (Q2934478) (← links)
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems (Q2954398) (← links)
- Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
- Guaranteed Matrix Completion via Non-Convex Factorization (Q2976533) (← links)
- Interference Alignment Using Finite and Dependent Channel Extensions: The Single Beam Case (Q2978818) (← links)
- Distributed Optimization in an Energy-Constrained Network: Analog Versus Digital Communication Schemes (Q2989382) (← links)
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints (Q3058502) (← links)
- Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization (Q3058514) (← links)
- (Q3079666) (← links)
- On the Communication Complexity of Solving a Polynomial Equation (Q3359763) (← links)
