Results 211 to 220 of about 6,868 (254)
Global Optimality Conditions for Some Classes of Optimization Problems
Journal of Optimization Theory and Applications, 2009 We establish new necessary and sufficient optimality conditions for global optimization problems. In particular, we establish tractable optimality conditions for the problems of minimizing a weakly convex or concave function subject to standard ...
A M Rubinov, Wu Z Y, Rubinov A M
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
High equilibrium optimizer for global optimization
Journal of Intelligent & Fuzzy Systems, 2021With the advent of the information age, people have higher requirements for basic algorithms. Meta-heuristic algorithms have received wide attention as a high-level strategy to study and generate fully optimized solutions to data-driven optimization problems.
Heming Jia, Xiaoxu Peng
openaire +1 more source
On global optimizations with polynomials
Optimization Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinghao Zhu, Xi Zhang
openaire +1 more source
Global Interconnect Optimization
ACM Transactions on Design Automation of Electronic Systems, 2019We propose a new comprehensive solution to global interconnect optimization. Traditional buffering algorithms mostly insert repeaters on a net-by-net basis based on slacks and possibly guided by global wires. We show how to integrate routing congestion, placement congestion, global timing constraints, power consumption, and additional ...
Siad Daboul +3 more
openaire +1 more source
2022
This chapter addresses the recent emerging topic known as safe global optimization, with \textit{safe} meaning that no \textit{safety constraints} are violated while sequentially performing evaluations of the noisy black-box objective function. Safety constraints can also be black-box.
Candelieri A, Kvasov D, Sergeev Y
openaire +2 more sources
This chapter addresses the recent emerging topic known as safe global optimization, with \textit{safe} meaning that no \textit{safety constraints} are violated while sequentially performing evaluations of the noisy black-box objective function. Safety constraints can also be black-box.
Candelieri A, Kvasov D, Sergeev Y
openaire +2 more sources
MONOTONIZATION IN GLOBAL OPTIMIZATION
Chinese Annals of Mathematics, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Zhiyou +2 more
openaire +2 more sources
Global optimality conditions for mixed nonconvex quadratic programs†
Optimization, 2009 In this article, we present some global optimality conditions for mixed quadratic programming problems. Our approach is based on a L-subdifferential and an associated L-normal cone.
Wu, Zhiyou, Bai, Fusheng
exaly +2 more sources
Global Descent Method for Global Optimization
SIAM Journal on Optimization, 2010This paper develops a novel method—the global descent method—for solving a general class of global optimization problems. This method moves from one local minimizer of the objective function $f$ to a better one at each iteration with the help of an auxiliary function termed the global descent function. The global descent function is not only guaranteed
Chi-Kong Ng +2 more
openaire +1 more source
Global Optimality Conditions in Nonconvex Optimization
Journal of Optimization Theory and Applications, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Global Optimality Conditions for Nonconvex Optimization
Journal of Global Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source