Results 121 to 130 of about 34,499 (189)

Improving air quality prediction using hybrid BPSO with BWAO for feature selection and hyperparameters optimization. [PDF]

Sci Rep
Sawah MS, Elmannai H, El-Bary AA, Lotfy K, Sheta OE.   +4 more
europepmc   +1 more source

Integrating multiple slack bus operations and metaheuristic techniques for power flow optimization. [PDF]

Sci Rep
Dahal S, Hegglid GJ, Kristiansen J, Chhetri BB, Mishra S, Øyvang T.   +5 more
europepmc   +1 more source

Research on Mobile Robot Path Planning Based on MSIAR-GWO Algorithm. [PDF]

Sensors (Basel)
Chen D, Liu J, Li T, He J, Chen Y, Zhu W.   +5 more
europepmc   +1 more source

Approximation of global optimal values of nonconvex programs using Successive Convex Relaxation Method (Continuous and Discrete Mathematics for Optimization)

Approximation of global optimal values of nonconvex programs using Successive Convex Relaxation Method (Continuous and Discrete Mathematics for Optimization)
openaire  

Some of the next articles are maybe not open access.

Related searches:

On Global Linear Convergence in Stochastic Nonconvex Optimization for Semidefinite Programming

IEEE Transactions on Signal Processing, 2019
Nonconvex reformulations via low-rank factorization for stochastic convex semidefinite optimization problem have attracted arising attention due to their empirical efficiency and scalability. Compared with the original convex formulations, the nonconvex ones typically involve much fewer variables, allowing them to scale to scenarios with millions of ...
Jinshan Zeng, Ke Ma, Yuan Yao
openaire   +3 more sources

Global optimization of nonconvex factorable programming problems

Mathematical Programming, 2001
In this paper is presented a global optimization approach for solving a class of nonconvex factorable programming problems, that arise in a variety of engineering process control and design problems. McCormick introduced the nonconvex factorable programming problem in 1976 in a different, but equivalent, form.
Sherali, Hanif D., Wang, Hongjie
openaire   +3 more sources

A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity

INFORMS Journal on Computing, 2021
We consider the classical convex constrained nonconvex quadratic programming problem where the Hessian matrix of the objective to be minimized has r negative eigenvalues, denoted by (QPr). Based on a biconvex programming reformulation in a slightly higher dimension, we propose a novel branch-and-bound algorithm to solve (QP1) and show that it returns ...
Xiaoli Cen, Yong Xia
openaire   +3 more sources

Global Optimization Versus Integer Programming in Portfolio Optimization under Nonconvex Transaction Costs

Journal of Global Optimization, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konno, Hiroshi, Yamamoto, Rei
openaire   +2 more sources

Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents

Journal of Global Optimization, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H. Sherali
openaire   +3 more sources