Results 201 to 210 of about 15,920 (255)

Transforming the automotive industry: Defining, clustering, and efficiency analysis of the next-generation automotive ecosystem. [PDF]

PLoS One
Shon M, Kim J, Kim H.
europepmc   +1 more source

A multi-period robust portfolio optimization framework using yager's entropy. [PDF]

PLoS One
Khosravi A, Sadjadi SJ.
europepmc   +1 more source

Adaptive linear MPC for a PMSM-driven autonomous EV with a filtered third-order generalized integrator observer. [PDF]

Sci Rep
Ismail MM, Al-Dhaifallah M, Rezk H, Refaat MM, Junejo AK.   +4 more
europepmc   +1 more source

An optimization framework for battery health management in vehicle-to-grid systems integrating transformer-based degradation prediction and grid service requirements. [PDF]

Sci Rep
Zhong C, Ma Q, Ren M, Xiong L.
europepmc   +1 more source

Novel eigenvector centrality indices for octane isomers to explore their physicochemical properties. [PDF]

Sci Rep
Rani ASJ, Balamurugan BJ.
europepmc   +1 more source

A time series based dynamic prediction model for loess mudstone landslides. [PDF]

Sci Rep
Tang C, Dong J, Peng L, Liu X, Pan Y, Wei Z, Tang M, Yao X.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Quadratic programs with hollows

Mathematical Programming, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boshi Yang, Kurt M. Anstreicher, Samuel Burer   +2 more
openaire   +2 more sources

A quadratic programming algorithm

Zeitschrift für Operations Research, 1988
Summary: By using conjugate directions a method for solving convex quadratic programming problems is developed. The algorithm generates a sequence of feasible solutions and terminates after a finite number of iterations. Extensions of the algorithm for nonconvex and large structured quadratic programming problems are discussed.
Michael J. Best, Klaus Ritter 0002
openaire   +2 more sources

On Quadratic Programming

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

Quadratic Matrix Programming

SIAM Journal on Optimization, 2007
We introduce and study a special class of nonconvex quadratic problems in which the objective and constraint functions have the form $f(\boldmath $X$)={Tr}(\boldmath $X$^T \boldmath $A$ \boldmath $X$) + 2 Tr(\boldmath $B$^T \boldmath $X$) +c, \boldmath $X$ \in {\real R}^{n \times r}$.
openaire   +1 more source