Results 171 to 180 of about 1,124 (204)

Global Optimization of Nonconvex Generalized Disjunctive Programs

2009
Abstract This paper is concerned with the global optimization of Bilinear and Concave Generalized Disjunctive Programs. The efficiency of methods to solve these problems relies heavily on their capability for predicting strong lower bounds that in turn depend on the strength of their relaxations.
Juan P. Ruiz, Ignacio E. Grossmann
openaire   +1 more source

Sufficient Conditions for Global Optimality of Bivalent Nonconvex Quadratic Programs with Inequality Constraints

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Z. Y., Jeyakumar, V., Rubinov, A. M.
openaire   +1 more source

Sufficient global optimality conditions for some nonconvex quadratic program problems

2010 Second International Conference on Communication Systems, Networks and Applications, 2010
In this paper, a class of quadratic program problem with quadratic constrains is studied. Some sufficient global optimality conditions for some nonconvex quadratic program problems with quadratic constrains are presented according to the property of L- subdifferential.
null Jia Zhang, null Zhiyuan Tian
openaire   +1 more source

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.
openaire   +2 more sources

RLT-Based Global Optimization Algorithms for Nonconvex Polynomial Programming Problems

1999
Thus far, we have considered the generation of tight relaxations leading to the convex hull representation for linear and nonlinear (polynomial) discrete mixed-integer programming problems using the Reformulation-Linearization Technique (RLT). It turns out that because of its natural facility to enforce relationships between different polynomial terms,
Hanif D. Sherali, Warren P. Adams
openaire   +1 more source

A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures

Journal of Global Optimization, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ramkumar Karuppiah, Ignacio E. Grossmann
openaire   +2 more sources

A Deterministic Lagrangian-Based Global Optimization Approach for Quasiseparable Nonconvex Mixed-Integer Nonlinear Programs

Journal of Mechanical Design, 2009
We propose a deterministic approach for global optimization of nonconvex quasiseparable problems encountered frequently in engineering systems design. Our branch and bound-based optimization algorithm applies Lagrangian decomposition to (1) generate tight lower bounds by exploiting the structure of the problem and (2) enable parallel computing of ...
Aida Khajavirad, Jeremy J. Michalek
openaire   +1 more source

Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

Acta Mathematica Sinica, English Series, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Advanced Approaches in Nonconvex Programming and Applications, Special Issue in Journal of Global Optimization

2021
International ...
Le Thi, Hoai An, Pham Dinh, Tao, Sergeyev, Yaroslav D.   +2 more
openaire   +1 more source

On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs

Journal of Global Optimization
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dillard Robertson, Pengfei Cheng, Joseph K. Scott   +2 more
openaire   +1 more source