Zhibin Deng

Works (7)

Updated: December 3rd, 2024 05:02

2024 article

A new global algorithm for homogeneous complex quadratic programming problems and applications

Yingzhe, X., Jintao, X., Cheng, L., Shu-Cherng, F., & Zhibin, D. (2024, January 1). Pacific Journal of Optimization, Vol. 20, pp. 667–682.

By: X. Yingzhe, X. Jintao, L. Cheng, F. Shu-Cherng & D. Zhibin*

author keywords: semidefinite relaxation; branch-and-bound algorithm; complex quadratic programming; beam- former design
topics (OpenAlex): Advanced Optimization Algorithms Research; Optimization and Mathematical Programming
Sources: Web Of Science, NC State University Libraries
Added: December 2, 2024

2019 journal article

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

Journal of Combinatorial Optimization, 11.

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

author keywords: Mixed-integer pogramming; Quadratic programming; Branch-and-bound algorithm
topics (OpenAlex): Risk and Portfolio Optimization; Electric Power System Optimization; Optimization and Variational Analysis
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, Crossref
Added: December 16, 2019

2013 article

A branch-and-cut approach to portfolio selection with marginal risk control in a linear conic programming framework

Deng, Z., Bai, Y., Fang, S.-C., Tian, Y., & Xing, W. (2013, December 1). Journal of Systems Science and Systems Engineering, Vol. 22, pp. 385–400.

By: Z. Deng n, Y. Bai *, S. Fang n , Y. Tian * & W. Xing*

author keywords: Portfolio selection; linear conic programming; branch-and-cut
topics (OpenAlex): Risk and Portfolio Optimization; Advanced Optimization Algorithms Research; Optimization and Variational Analysis
TL;DR: This paper investigates the portfolio selection problem with direct marginal risk control in a linear conic programming framework with semidefinite programming (SDP) relaxation problems over some subrectangles and proposes an adaptive branch-and-cut rule to speed up the computation. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2013 conference paper

Comparison of an ℓ1-regression-based and a RANSAC-based planar segmentation procedure for urban terrain data with many outliers

In L. Bruzzone (Ed.), Image and Signal Processing for Remote Sensing XIX (p. 889209).

By: J. Luo  n, Z. Deng n, D. Bulatov *, J. Lavery n & S. Fang n 

Ed(s): L. Bruzzone

author keywords: DBSCAN; fuzzy c-means; l(1) regression; outlier-rich; planar; RANSAC; segmentation; urban terrain
topics (OpenAlex): Remote Sensing and LiDAR Applications; Land Use and Ecosystem Services; Remote Sensing in Agriculture
TL;DR: The complete building reconstruction procedure into which the ℓ1-regression-based and RANSAC-based segmentation procedures will be integrated in the future is outlined. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities (Web of Science; OpenAlex)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2013 journal article

Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming

Journal of Industrial and Management Optimization, 9(3), 703–721.

By: Y. Tian, S. Fang , Z. Deng & W. Xing

Source: NC State University Libraries
Added: August 6, 2018

2013 journal article

Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme

European Journal of Operational Research, 229(1), 21–28.

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

author keywords: Conic programming; Copositive; Cone of nonnegative quadratic functions; Adaptive approximation scheme
topics (OpenAlex): Advanced Optimization Algorithms Research; Matrix Theory and Algorithms; Sparse and Compressive Sensing Techniques
TL;DR: This decision problem is transformed into a quadratic programming problem, which can be approximated by solving a sequence of linear conic programming problems defined on the dual cone of the cone of nonnegative quadRatic functions over the union of a collection of ellipsoids. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2013 article

Quadratic optimization over one first-order cone

Guo, X., Deng, Z., Fang, S.-C., & Xing, W. (2013, November 27). Journal of Industrial and Management Optimization, Vol. 10, pp. 945–963.

By: X. Guo, Z. Deng*, S. Fang*  & W. Xing

author keywords: Quadratic programming; cone of nonnegative quadratic forms; first-order cone; linear conic programming; adaptive scheme
topics (OpenAlex): Advanced Optimization Algorithms Research; Sparse and Compressive Sensing Techniques; Matrix Theory and Algorithms
Sources: Web Of Science, NC State University Libraries
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© (2026) 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.