Quasiconvex relaxations based on interval arithmetic
From MaRDI portal
Publication:5929744
DOI10.1016/S0024-3795(00)00295-0zbMath0978.65049MaRDI QIDQ5929744
Publication date: 16 April 2001
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
global optimizationbranch-and-bound algorithmnonlinear systemnumerical examplesrelaxationquasiconvex functioninterval arithmeticpseudoconvex functionquasiconcave functionquasilinear functionrange of function
Numerical mathematical programming methods (65K05) Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Interval and finite arithmetic (65G30)
Related Items
An efficient algorithm for finding all solutions of nonlinear equations using parallelogram LP test ⋮ Lower bound functions for polynomials ⋮ A new global optimization method for univariate constrained twice-differentiable NLP problems
Uses Software
Cites Work
- Quasiconvex, pseudoconvex, and strictly pseudoconvex quadratic functions
- Generalized concavity
- A collection of test problems for constrained global optimization algorithms
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- Handbook of global optimization
- Rigorous global search: continuous problems
- Interval solution of nonlinear equations using linear programming
- Convex-concave extensions
- Convergence of the (GOP) algorithm for a large class of smooth optimization problems
- Manifestations of the Schur complement
- A branch-and-reduce approach to global optimization
- Jointly Constrained Biconvex Programming
- Interval Slopes for Rational Functions and Associated Centered Forms
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Interval Methods for Systems of Equations
- Bounding the Solution of Interval Linear Equations
- An algorithm for nonconvex programming problems
- A Successive Underestimation Method for Concave Minimization Problems
- Expansion and estimation of the range of nonlinear functions
- An Algorithm for Separable Nonconvex Programming Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
