The following pages link to Guo-Qiang Wang (Q376768):
Displaying 50 items.
- A new three-term conjugate gradient algorithm for unconstrained optimization (Q120735) (← links)
- (Q257746) (redirect page) (← links)
- Several matrix trace inequalities on Hermitian and skew-Hermitian matrices (Q257748) (← links)
- A note on an inequality involving Jordan product in Euclidean Jordan algebras (Q276321) (← links)
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints (Q291885) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- Generalization of \(C^{1,1}\) property in infinite dimension (Q300661) (← links)
- A hybrid time-scaling transformation for time-delay optimal control problems (Q301724) (← links)
- On the quadratic eigenvalue complementarity problem (Q330258) (← links)
- New hybrid conjugate gradient projection method for the convex constrained equations (Q331803) (← links)
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem (Q376771) (← links)
- Low-rank tensor completion by Riemannian optimization (Q398628) (← links)
- A model-hybrid approach for unconstrained optimization problems (Q403087) (← links)
- Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636) (← links)
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties (Q415335) (← links)
- (Q415400) (redirect page) (← links)
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
- Convergence analysis and performance of the extended artificial physics optimization algorithm (Q426928) (← links)
- A class of primal affine scaling algorithms (Q427024) (← links)
- Regularization techniques in interior point methods (Q432801) (← links)
- Error bounds for linear complementarity problems for \(SB\)-matrices (Q451806) (← links)
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721) (← links)
- An eigenvalue study on the sufficient descent property of a modified Polak-Ribière-Polyak conjugate gradient method (Q464539) (← links)
- Some new error bounds for linear complementarity problems of H-matrices (Q466852) (← links)
- Comparison of multiple random walks strategies for searching networks (Q474593) (← links)
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems (Q663722) (← links)
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130) (← links)
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- A generalization of the Craig-Sakamoto theorem to Euclidean Jordan algebras (Q905710) (← links)
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
- A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
- Erratum to: ``Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization'' (Q1673906) (← links)
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term (Q1724788) (← links)
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier (Q1935397) (← links)
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
- Mean first passage time of preferential random walks on complex networks with applications (Q1993191) (← links)
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem (Q2046555) (← links)
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (Q2249820) (← links)
- A homotopy method for nonlinear second-order cone programming (Q2256956) (← links)
- A dual algorithm for a class of augmented convex signal recovery models (Q2257625) (← links)
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming (Q2260662) (← links)
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) (← links)
