An algorithm for maximizing a convex function over a simple set
From MaRDI portal
Publication:1918984
DOI10.1007/BF02403999zbMath0851.90091OpenAlexW4250243394MaRDI QIDQ1918984
Publication date: 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02403999
Related Items
Global optimization reduction of generalized Malfatti's problem ⋮ New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming ⋮ Global optimization approach to Malfatti's problem ⋮ Solving Malfatti's high dimensional problem by global optimization ⋮ An Algorithm for Maximizing a Convex Function Based on Its Minimum ⋮ Global search method for solving Malfatti's four-circle problem ⋮ Piece adding technique for convex maximization problems ⋮ Covering balls and \(\mathcal{HT}\)-\textit{differential} for convex maximization ⋮ A maximization algorithm of pseudo-convex quadratic functions ⋮ Global minimization algorithms for concave quadratic programming problems ⋮ A numerical approach for solving some convex maximization problems ⋮ Inscribed ball and enclosing box methods for the convex maximization problem ⋮ Lipschitz programming via increasing convex-along-rays functions* ⋮ Generalized Nash equilibrium problem based on Malfatti's problem ⋮ A global optimization approach for solving non-monotone variational inequality problems
Cites Work
- Unnamed Item
- On the global minimization of concave functions
- Constrained global optimization: algorithms and applications
- Outer approximation by polyhedral convex sets
- Multidimensional bisection applied to global optimisation
- Normal conical algorithm for concave minimization over polytopes
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Post algebras as semantic bases of some many-valued logics
