Finding all solutions of nonlinearly constrained systems of equations
From MaRDI portal
Publication:1904647
DOI10.1007/BF01097059zbMath0841.90115OpenAlexW2046526480MaRDI QIDQ1904647
Costas D. Maranas, Christodoulos A. Floudas
Publication date: 24 July 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01097059
global optimizationslack variablesall solutions\(\varepsilon\)-feasible solutionsnonlinearly constrained systems of equations
Related Items
ARGONAUT: algorithms for global optimization of constrained grey-box computational problems, Interval arithmetic for nonlinear problem solving, A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics, Global Optimization of Mixed-Integer Signomial Programming Problems, A superlinearly convergent projection method for constrained systems of nonlinear equations, Unnamed Item, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Topographical global initialization for finding all solutions of nonlinear systems with constraints, Deterministic global optimization in ab-initio quantum chemistry, Convex relaxation for solving posynomial programs, \(\alpha BB\): A global optimization method for general constrained nonconvex problems, A reformulation framework for global optimization, GLOMIQO: global mixed-integer quadratic optimizer, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, On generalizing Descartes' rule of signs to hypersurfaces, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Nonsmooth exclusion test for finding all solutions of nonlinear equations, A framework for globally optimizing mixed-integer signomial programs, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, Explicit hybrid model-predictive control: the exact solution, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, A review of deterministic optimization methods in engineering and management, Finding multiple optimal solutions of signomial discrete programming problems with free variables, Global solution of optimization problems with signomial parts, Convergence rate of McCormick relaxations, Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations, On the functional form of convex underestimators for twice continuously differentiable functions, A branch-and-cut algorithm for a class of sum-of-ratios problems, Convex underestimation for posynomial functions of positive variables, A projection method for a system of nonlinear monotone equations with convex constraints, A nonmonotone projection method for constrained system of nonlinear equations, Cutting ellipses from area-minimizing rectangles, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, Convergence analysis of multivariate McCormick relaxations, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Piecewise-linear approximations of multidimensional functions, Improve-and-branch algorithm for the global optimization of nonconvex NLP problems, A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization, Modified projection method for solving a system of monotone equations with convex constraints, Spectral gradient projection method for monotone nonlinear equations with convex constraints, Trigonometric convex underestimator for the base functions in Fourier space, Performance of convex underestimators in a branch-and-bound framework, Preface, Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization, Convexity of products of univariate functions and convexification transformations for geometric programming, Rigorous convex underestimators for general twice-differentiable problems, Global optimization of signomial mixed-integer nonlinear programming problems with free variables, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, Molecular conformation of \(n\)-alkanes using terrain/funneling methods, Some transformation techniques with applications in global optimization, Cutting circles and polygons from area-minimizing rectangles, Identification of mechanical properties of arteries with certification of global optimality, A parsimonious model for generating arbitrage-free scenario trees, Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Experiments using interval analysis for solving a circuit design problem
- Global minimum potential energy conformations of small molecules
- Handbook of global optimization
- Introduction to global optimization
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Global optimization for molecular conformation problems
- Algorithm 652
- Jointly Constrained Biconvex Programming
- The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations
- Interval Methods for Systems of Equations
- Chemical equilibrium systems as numerical test problems
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
