Results 311 to 320 of about 6,410,351 (366)
Some of the next articles are maybe not open access.
2001
As it was pointed out in Chapter Two, if f j (x j ) are strictly convex and g ij (x j ) are convex for i= 1,..., m and j ∉ L, the standard simplex method, discarding the restricted basis entry rule, is applicable to the approximating linear program (LASP) (2.17) – (2.21).
openaire +1 more source
As it was pointed out in Chapter Two, if f j (x j ) are strictly convex and g ij (x j ) are convex for i= 1,..., m and j ∉ L, the standard simplex method, discarding the restricted basis entry rule, is applicable to the approximating linear program (LASP) (2.17) – (2.21).
openaire +1 more source
Sequential convex programming for nonlinear optimal control problem in UAV path planning
American Control Conference, 2017Zhe Zhang, Jian-xun Li, Jun Wang
semanticscholar +1 more source
2001
The theory of convex models can be used to study a large class of non-linear programs called “partly convex programs” (abbreviation: PCP).
openaire +1 more source
The theory of convex models can be used to study a large class of non-linear programs called “partly convex programs” (abbreviation: PCP).
openaire +1 more source
Synthesis of Maximum-Efficiency Beam Arrays via Convex Programming and Compressive Sensing
IEEE Antennas and Wireless Propagation Letters, 2017A. Morabito
semanticscholar +1 more source
Curves ahead: molecular receptors for fullerenes based on concave–convex complementarity
Chemical Society Reviews, 2008Emilio M Pérez, Nazario Martín
exaly