Jin-Bao Jian

dblp:25/1000 · also Jin-bao Jian, Jinbao Jian · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2024 A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization
Jianghua Yin, Chunming Tang 0002, Jin-Bao Jian, Qiongxuan Huang
J. Glob. Optim.3
2017 Multiple Perspective-Cuts Outer Approximation Method for Risk-Averse Operational Planning of Regional Energy Service Providers
abstract
In the smart grid and future energy internet environment, a regional energy service provider (RESP) may be able to integrate multiple energy resources such as generator units, demand response, electrical vehicle charging/swapping stations, and carbon emission trading to participate in the market. By imploring a well-known portfolio optimization theory conditional value-at-risk to tackle electricity price uncertainty, this paper formulates the risk-averse day-ahead operational planning for such a RESP as a mixed-integer quadratically constrained programming (MIQCP), named as RA-RESP. A global optimization method, named as multiple perspective-cuts outer approximation method (MPC-OAM) is proposed to solve this model efficiently. A remarkable stronger and tighter mixed integer linear programing master problem is designed to accelerate the convergence of the proposed method. Comprehensive simulation results show that, compared with existing day-ahead planning models, the RA-RESP is a good compromise between profit-based models and cost-based ones. The proposed MPC-OAM can solve complicated RA-RESP problem efficiently, and compared with state-of-the-art solution techniques, the MPC-OAM outperforms in both computing speed and solution quality, especially for scenario which includes more nonlinear factors.
Linfeng Yang, Jin-Bao Jian, Yan Xu 0005, Zhao Yang Dong
IEEE Trans. Ind. Informatics2
2005 A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints
Jian-Ling Li, Jin-Bao Jian
J. Glob. Optim.2
2004 Explicit and Implicit Continuation Algorithms for Strongly Monotone Variational Inequalities with Box Constraints
Jin-Bao Jian, Xing-De Mo, Jian-Ling Li
J. Glob. Optim.1
1999 A Combined Feasible-Infeasible Point Continuation Method for Strongly Monotone Variational Inequality Problems
Jin-Bao Jian
J. Glob. Optim.1