Results 131 to 140 of about 34,499 (189)
Some of the next articles are maybe not open access.
A global optimization method for nonconvex separable programming problems
European Journal of Operational Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Han-Lin, Yu, Chian-Son
openaire +3 more sources
Journal of Global Optimization
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dillard Robertson +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dillard Robertson +2 more
openaire +2 more sources
Computers & Chemical Engineering, 2001
Abstract A global optimization algorithm for nonconvex Generalized Disjunctive Programming (GDP) problems is proposed in this paper. By making use of convex underestimating functions for bilinear, linear fractional and concave separable functions in the continuous variables, the convex hull of each nonlinear disjunction is constructed.
Sangbum Lee, Ignacio E. Grossmann
openaire +2 more sources
Abstract A global optimization algorithm for nonconvex Generalized Disjunctive Programming (GDP) problems is proposed in this paper. By making use of convex underestimating functions for bilinear, linear fractional and concave separable functions in the continuous variables, the convex hull of each nonlinear disjunction is constructed.
Sangbum Lee, Ignacio E. Grossmann
openaire +2 more sources
Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
Acta Mathematica Sinica, English Series, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yong Xia
openaire +2 more sources
SIAM Journal on Optimization, 2021
This paper proposes and analyzes a dampened proximal alternating direction method of multipliers (DP.ADMM) for solving linearly-constrained nonconvex optimization problems where the smooth part of the objective function is nonseparable. Each iteration of
W. Kong, R. Monteiro
semanticscholar +1 more source
This paper proposes and analyzes a dampened proximal alternating direction method of multipliers (DP.ADMM) for solving linearly-constrained nonconvex optimization problems where the smooth part of the objective function is nonseparable. Each iteration of
W. Kong, R. Monteiro
semanticscholar +1 more source
Mathematical programming, 2021
We consider the global optimization of nonconvex mixed-integer quadratic programs with linear equality constraints. In particular, we present a new class of convex quadratic relaxations which are derived via quadratic cuts.
Carlos J. Nohra +2 more
semanticscholar +1 more source
We consider the global optimization of nonconvex mixed-integer quadratic programs with linear equality constraints. In particular, we present a new class of convex quadratic relaxations which are derived via quadratic cuts.
Carlos J. Nohra +2 more
semanticscholar +1 more source
Global optimality conditions for mixed nonconvex quadratic programsâ€
Optimization, 2009In 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. Unlike most subdifferentials, the L-subdifferential is formed by functions that are not necessarily linear functions.
Z.Y. Wu, F.S. Bai
openaire +1 more source
Global optimization of a rank-two nonconvex program
Mathematical Methods of Operations Research, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CAMBINI, RICCARDO, SODINI, CLAUDIO
openaire +1 more source
Industrial & Engineering Chemistry Research, 1988
Gary R. Kocis, Ignacio E. Grossmann
openaire +2 more sources
Gary R. Kocis, Ignacio E. Grossmann
openaire +2 more sources
Global optimization of nonconvex nonlinear programs via interval analysis
Computers & Chemical Engineering, 1994Abstract A new global-optimization procedure is devised to tackle nonconvex nonlinear programming problems. The proposed algorithm is based on interval analysis and is guaranteed to yield the global solution. Several new accelerating tools are introduced to significantly reduce the computational intensity associated with classical interval-based ...
R. Vaidyanathan, M. El-Halwagi
openaire +1 more source