Results 241 to 250 of about 21,242 (297)
Enhanced twin delayed DDPG with prioritized experience replay and Noisy Nets for regional economic dispatch. [PDF]
Sci RepXu C +5 more
europepmc +1 more source
Data-driven vehicle stability control via co-simulation of digital twin and constrained MPC. [PDF]
Sci RepLin M, Zhang Z, Huang M, Ding Y.
europepmc +1 more source
Global minimum time trajectory planning considering curvature and distance for track racing. [PDF]
Sci RepZhang D, Yuan Y, Zhu F.
europepmc +1 more source
Real time dynamic adhesion coefficient estimation and BP neural network optimized lateral stability control for distributed drive electric vehicles. [PDF]
Sci RepZhou Z, Yang R, Xu F, Shen W.
europepmc +1 more source
GBA Solver: a user-friendly web server for growth balance analysis. [PDF]
BioinformaticsGhaffarinasab S, Dourado H.
europepmc +1 more source
Hierarchical Quadratic Programming: Companion report
, 2015 Adrien Escande +2 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
WIREs Computational Statistics, 2015
Optimization problems in which a quadratic objective function is optimized subject to linear constraints on the parameters are known asquadratic programming problems(QPs). This focus article reviews algorithms for convexQPs(in which the objective is a convex function) and provides pointers to various online resources aboutQPs.WIREs Comput Stat2015, 7 ...
Berwin A. Turlach, Stephen J. Wright
openaire +3 more sources
Optimization problems in which a quadratic objective function is optimized subject to linear constraints on the parameters are known asquadratic programming problems(QPs). This focus article reviews algorithms for convexQPs(in which the objective is a convex function) and provides pointers to various online resources aboutQPs.WIREs Comput Stat2015, 7 ...
Berwin A. Turlach, Stephen J. Wright
openaire +3 more sources
Management Science, 1971
A procedure based on Lemke's algorithm is developed which either computes stationary points for general quadratic programs or else shows that the program has no optimum. If a general quadratic program has an optimum and satisfies a non-degeneracy condition then it is demonstrated that there are an odd number of stationary points.
openaire +1 more source
A procedure based on Lemke's algorithm is developed which either computes stationary points for general quadratic programs or else shows that the program has no optimum. If a general quadratic program has an optimum and satisfies a non-degeneracy condition then it is demonstrated that there are an odd number of stationary points.
openaire +1 more source
Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
INFORMS Journal on Computing, 2021We study perspective reformulations (PRs) of semicontinuous quadratically constrained quadratic programs (SQCQPs) in this paper. Based on perspective functions, we first propose a class of PRs for SQCQPs and discuss how to find the best PR in this class via strong duality and lifting techniques.
Xiaojin Zheng, Yutong Pan, Zhaolin Hu
openaire +2 more sources