Works (4)

Updated: July 5th, 2023 15:48

2019 journal article

Fast computation of global solutions to the single-period unit commitment problem

Journal of Combinatorial Optimization, 44(3), 1511–1536.

By: C. Lu*, Z. Deng*, S. Fang n, Q. Jin* & W. Xing*

author keywords: Mixed-integer pogramming; Quadratic programming; Branch-and-bound algorithm
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID, Crossref
Added: December 16, 2019

2012 journal article

Univariate cubic L-1 interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 51(2), 575–600.

By: Q. Jin n, L. Yu n, J. Lavery n & S. Fang n

author keywords: Cubic L-1 spline; First-derivative-based; Interpolation; Locally calculated; Shape preservation
TL;DR: It is shown that cubic L1 splines based on the first derivative and on 5-point windows preserve linearity of the original data and avoid extraneous oscillation. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2011 journal article

KKT SOLUTION AND CONIC RELAXATION FOR SOLVING QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING PROBLEMS

SIAM JOURNAL ON OPTIMIZATION, 21(4), 1475–1490.

By: C. Lu, S. Fang*, Q. Jin*, Z. Wang & W. Xing

author keywords: quadratically constrained quadratic programming; conic programming; global optimality condition; solvable condition
TL;DR: This study leads to a global optimality condition that is more general than the known positive semidefiniteness condition in the literature and proposes a computational scheme that provides clues of designing effective algorithms for more solvable quadratically constrained quadratic programming problems. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2010 journal article

On the global optimality of generalized trust region subproblems

OPTIMIZATION, 59(8), 1139–1151.

By: Q. Jin n, S. Fang n & W. Xing*

author keywords: global optimization; quadratic programming; generalized trust region subproblems; Lagrangian
TL;DR: The duality property between the primal problem and its Lagrangian dual problem is analysed, and the attainability of the optimal primal solution without the Slater condition is discussed. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.