Results 101 to 110 of about 7,641,552 (201)

Analog circuit design by nonconvex polynomial optimization: Two design examples

, 2010
We present a framework for synthesizing low-power analog circuits through global optimization over generally nonconvex multivariate polynomial objective function and constraints.
Lui, SH, Kwan, HK, Wong, N
core   +1 more source

Global Optimization for Nonconvex Stochastic Mixed-Integer Nonlinear Programs

We apply sample average approximation (Shapiro, 2003) for solving nonconvex stochastic MINLPs. Global optimality with a probabilistic measure is assured by solving the MINLP samples via convexification techniques (Tawarmalani and Sahinidis, 2004) within spatial branchand-bound and/or outer approximation (Duran and Grossmann, 1986).  ...
Furman, Kevin, Wei, Jing, Duran, Marco, Tawarmalani, Mohit, Sahinidis, Nikolaos   +4 more
openaire   +1 more source

DC programming and DCA for nonconvex optimization/ global optimization in mixed integer programming : Codes and applications

, 2013
Based on theoretical and algorithmic tools of DC programming and DCA, the research in this thesis focus on the local and global approaches for non convex optimization and global mixed integer optimization. The thesis consists of 5 chapters. The first chapter presents fundamentals of DC programming and DCA, and techniques of Branch and Bound method (B&B)
openaire   +1 more source

Global optimization tailored for graphics processing units: Complete and rigorous search for large-scale nonlinear minimization. [PDF]

PNAS Nexus
Zhang G, Shan Q, Cagan J.
europepmc   +1 more source

Energy-Efficient 3D Trajectory Optimization and Resource Allocation for UAV-Enabled ISAC Systems. [PDF]

Entropy (Basel)
Jing L, Wang H, Qin Z, Zhao Y, Zhu Y, Zhao W.   +5 more
europepmc   +1 more source

Joint Beamforming for Integrated Satellite-Terrestrial ISAC Systems. [PDF]

Sensors (Basel)
Wang T, Wang Q.
europepmc   +1 more source

On nonconvex quadratic programming with box constraints

, 2009
Nonconvex quadratic programming with box constraints is a fundamental NP-hard global optimization problem. Recently, some authors have studied a certain family of convex sets associated with this problem.
Adam N. Letchford, Samuel Burer
core  

On computational search for optimistic solutions in bilevel problems

Bilevel programming, Optimistic solution, Nonconvex optimization problems, Local search, Global search, Computational simulation,
Anton Malyshev, Andrey Orlov, Alexander Strekalovsky   +2 more
core   +1 more source

Large-scale semidefinite programming with graphics processing units. [PDF]

Proc Natl Acad Sci U S A
Han Q, Lin Z, Liu H, Chen C, Deng Q, Ge D, Ye Y.   +6 more
europepmc   +1 more source

Intelligent optimization of natural gas pipeline compressor stations. [PDF]

iScience
Zhao Z, Li L, Sun Z, Lv Q, Li X.
europepmc   +1 more source