Results 91 to 100 of about 7,641,552 (201)
A class of nonconvex semidefinite programming in which every KKT point is globally optimal
We consider a special class of nonconvex semidefinite programming problems and show that every point satisfying the Karush--Kuhn--Tucker (KKT) conditions is globally optimal despite nonconvexity. This property is related to pseudoconvex optimization and fractional programming.
Nishioka, Akatsuki, Kanno, Yoshihiro
openaire +2 more sources
Impact of endogenous learning curves on maritime transition pathways
Environmental Research LettersThe maritime industry is a crucial hard-to-abate sector that is expected to depend on high-energy density renewable liquid fuels in the future. Traditionally, decarbonization pathways have been assessed assuming exogenous cost trajectories for renewable ...
Sebastian Franz, Rasmus Bramstoft
doaj +1 more source
Industrial & Engineering Chemistry ResearchNonconvex quadratically constrained programs (QCPs) with bilinear terms frequently arise in the optimization of chemical process systems such as water-using networks (WUNs). While global optimization approaches based on spatial branch-and-bound and mixed-integer linear programming relaxations have achieved significant advances, they remain ...
Diogo Rodrigues, Pedro M. Castro
openaire +2 more sources
Combinatorial and global optimization
, 2002 "Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that
Migdalas, Athanasios. +5 more
core +1 more source
Peeling off a nonconvex cover of an actual convex problem: Hidden convexity
, 2007 Convexity is, without a doubt, one of the most desirable features in optimization. Many optimization problems that are nonconvex in their original settings may become convex after performing certain equivalent transformations.
Wu, Zhiyou +3 more
core +1 more source
Why Methods for Optimization Problems with Time-Consuming Function Evaluations and Integer Variables Should Use Global Approximation Models [PDF]
This paper advocates the use of methods based on global approximation models for optimization problems with time-consuming function evaluations and integer variables.We show that methods based on local approximations may lead to the integer rounding of ...
Brekelmans, R.C.M. +4 more
core
Global optimality conditions and optimization methods for quadratic integer programming problems
, 2011 Global optimality conditions, Quadratic integer programming problem, Optimization method, Auxiliary function, 41A65, 41A29, 90C30,
Wu, Zhiyou +7 more
core +1 more source
, 2009 Written by some of the leading experts in complementarity, duality, global optimization, and quantum computations, this collection reveals the beauty of these mathematical disciplines.
Sherali, Hanif D, Gao, David Yang
core +1 more source
Optimization of stochastic switching buffer network via DC programming
, 2022 This letter deals with the optimization problems of stochastic switching buffer networks, where the switching law is governed by Markov process. The dynamical buffer network is introduced, and its application in modeling the car-sharing network is also ...
Zhao, Chengyan +2 more
core
Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
, 2016 International audienceIn this paper, we consider a bilevel polynomial optimization problem where the objective and the constraint functions of both the upper-and the lower-level problems are polynomi-als.
Li, G ; https://orcid.org/ +8 more
core +1 more source