Person:376768: Difference between revisions

From MaRDI portal
Person:376768
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Guo-Qiang Wang to Guo-Qiang Wang: Duplicate
 
(No difference)

Latest revision as of 22:57, 9 December 2023

Available identifiers

zbMath Open wang.guoqiangMaRDI QIDQ376768

List of research outcomes





PublicationDate of PublicationType
A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation2025-01-20Paper
Kernel-based full-Newton step feasible interior-point algorithm for \(P_* (\kappa)\)-weighted linear complementarity problem2024-09-02Paper
A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm2023-06-28Paper
https://portal.mardi4nfdi.de/entity/Q50703872022-04-11Paper
A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem2021-08-18Paper
Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term2019-02-14Paper
Mean first passage time of preferential random walks on complex networks with applications2018-11-05Paper
https://portal.mardi4nfdi.de/entity/Q31340902018-02-08Paper
Erratum to: ``Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization2017-10-27Paper
Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone2017-09-26Paper
Model following control system with time delays2016-10-26Paper
A hybrid time-scaling transformation for time-delay optimal control problems2016-07-01Paper
A note on an inequality involving Jordan product in Euclidean Jordan algebras2016-05-03Paper
Several matrix trace inequalities on Hermitian and skew-Hermitian matrices2016-03-17Paper
A generalization of the Craig-Sakamoto theorem to Euclidean Jordan algebras2016-01-28Paper
A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization2016-01-19Paper
Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization2015-09-11Paper
Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term2015-07-14Paper
Primal-dual interior-point algorithms for convex quadratic circular cone optimization2015-07-14Paper
Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization2015-06-01Paper
Comparison of multiple random walks strategies for searching networks2014-11-24Paper
A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems2014-07-03Paper
New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP2014-02-21Paper
Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem2013-11-19Paper
Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization2013-07-30Paper
Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP2013-06-24Paper
Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier2013-02-15Paper
A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization2013-02-11Paper
Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions2012-11-06Paper
A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS2012-08-31Paper
A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones2012-05-08Paper
A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO2011-08-16Paper
A Weighted-Path-Following Method for Monotone Horizontal Linear Complementarity Problem2011-03-02Paper
A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem2010-11-19Paper
A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization2009-11-11Paper
A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step2009-10-14Paper
Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem2009-10-09Paper
Primal-dual interior-point algorithm for convex quadratic semi-definite optimization2009-07-24Paper
A new primal-dual interior-point algorithm for convex quadratic optimization2009-07-22Paper
Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization2009-07-22Paper
A new primal-dual path-following interior-point algorithm for semidefinite optimization2009-04-29Paper
A class of large-update and small-update primal-dual interior-point algorithms for linear optimization2009-04-24Paper
Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions2009-04-14Paper
Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function2008-03-14Paper
A class of polynomial primal-dual interior-point algorithms for semidefinite optimization2007-01-19Paper
Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function2006-01-17Paper

Research outcomes over time

This page was built for person: Guo-Qiang Wang