Primal-relaxed dual global optimization approach
From MaRDI portal
Publication:1321372
DOI10.1007/BF00939667zbMath0796.90056OpenAlexW2102884589MaRDI QIDQ1321372
V. Visweswaran, Christodoulos A. Floudas
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00939667
global optimizationpolynomial functions\(\varepsilon\)-finite convergence\(\varepsilon\)-global optimalitynonconvex constrained nonlinear programming
Related Items
An accelerating algorithm for globally solving nonconvex quadratic programming, Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem, A relaxation method for nonconvex quadratically constrained quadratic programs, Co-design of linear systems using generalized Benders decomposition, New results in the packing of equal circles in a square, Generation expansion planning with revenue adequacy constraints, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs, A reformulation-convexification approach for solving nonconvex quadratic programming problems, Large-scale standard pooling problems with constrained pools and fixed demands, DC Programming Approaches for BMI and QMI Feasibility Problems, \(\alpha BB\): A global optimization method for general constrained nonconvex problems, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, A global optimization algorithm using parametric linearization relaxation, A parameter optimization heuristic for a temperature estimation model, Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Decomposition strategy for the stochastic pooling problem, Solving long-term financial planning problems via global optimization, On box constrained concave quadratic optimization, Gradient-type methods: a unified perspective in computer science and numerical analysis, Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints, A new algorithm for box-constrained global optimization, Financial planning via multi-stage stochastic optimization., Robust stability analysis of systems with real parametric uncertainty: A global optimization approach, A convex analysis approach for convex multiplicative programming, On the Use of a Mixed Integer Non-linear Programming Model for Refrigerant Design, Unconstrained and constrained global optimization of polynomial functions in one variable, Biconvex sets and optimization with biconvex functions: a survey and extensions, Global solution of non-convex quadratically constrained quadratic programs, New multi-commodity flow formulations for the pooling problem, A global supply chain model with transfer pricing and transportation cost allocation, A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints, Linearization method of global optimization for generalized geometric programming, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Global descent methods for unconstrained global optimization, On the global optimization of sums of linear fractional functions over a convex set, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem, Improve-and-branch algorithm for the global optimization of nonconvex NLP problems, Canonical dual least square method for solving general nonlinear systems of quadratic equations, Scenario generation and stochastic programming models for asset liability management, A scalable global optimization algorithm for stochastic nonlinear programs, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, Solutions to quadratic minimization problems with box and integer constraints, Convergence of the (GOP) algorithm for a large class of smooth optimization problems, Rigorous convex underestimators for general twice-differentiable problems, Generalized primal-relaxed dual approach for global optimization, Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, A remark on the GOP algorithm for global optimization, An algorithm for global solution to bi-parametric linear complementarity constrained linear programs, Global minimum potential energy conformations of small molecules, A global optimization method, QBB, for twice-differentiable nonconvex optimization problem, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints, Global minimization by reducing the duality gap
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Jointly constrained bilinear programs and related problems: An overview
- On outer approximation methods for solving concave minimization problems
- Convex programs with an additional reverse convex constraint
- Global minimization of indefinite quadratic problems
- Constrained global optimization: algorithms and applications
- Global optimization using interval analysis - the multi-dimensional case
- Dual quadratic estimates in polynomial and Boolean programming
- An analytical approach to global optimization
- A new simplicial cover technique in constrained global optimization
- Reduction of indefinite quadratic programs to bilinear programs
- Unconstrained and constrained global optimization of polynomial functions in one variable
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A collection of test problems for constrained global optimization algorithms
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Generalized Benders decomposition
- A decomposition approach for global optimum search in QP, NLP and MINLP problems
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Methods for Global Concave Minimization: A Bibliographic Survey
- Global minimization of a difference of two convex functions
- A resource decomposition algorithm for general mathematical programs
- An algorithm for finding the absolute extremum of a function
- The Validity of a Family of Optimization Methods
- Global optimization
