B
Bin Li
Researcher at Sichuan University
Publications - 105
Citations - 1241
Bin Li is an academic researcher from Sichuan University. The author has contributed to research in topics: Optimal control & Optimization problem. The author has an hindex of 18, co-authored 92 publications receiving 907 citations. Previous affiliations of Bin Li include Harbin Institute of Technology & Luoyang Institute of Science and Technology.
Papers
More filters
Journal ArticleDOI
Mesostructured nanomagnetic polyhedral oligomeric silsesquioxanes (POSS) incorporated with dithiol organic anchors for multiple pollutants capturing in wastewater.
TL;DR: Beyond the environmental remediation function, thanks to the pendant vinyl groups, the Fe3O4@POSS derived materials rationally integrating distinct or versatile functions could be envisaged and consequently a wide variety of applications may emerge.
Journal ArticleDOI
An Exact Penalty Function Method for Continuous Inequality Constrained Optimal Control Problem
TL;DR: This paper considers a class of optimal control problems subject to equality terminal state constraints and continuous state and control inequality constraints, and shows that, for sufficiently large penalty parameter value, any local minimizer of the unconstrained optimization problem is a local minimizers of the optimization problem with equality constraint and continuous inequality constraints.
Journal ArticleDOI
Finite iterative solutions to coupled Sylvester-conjugate matrix equations
TL;DR: In this paper, the existence of a solution to a coupled Sylvester-conjugate matrix equation can be determined automatically by using a real inner product in complex matrix spaces as a tool that can be obtained within finite iteration steps for any initial values in the absence of round-off errors.
Journal ArticleDOI
Delay-Sensitive Multi-Period Computation Offloading with Reliability Guarantees in Fog Networks
TL;DR: Comprehensive evaluations demonstrate that the Lagreedy algorithm is able to obtain the shortest delay with a high power consumption, while the branch-and-bound algorithm can achieve both shorter delay and lower power consumption with reliability guarantees.