An algorithm for maximizing a convex function over a simple set
From MaRDI portal
Publication:1918984
DOI10.1007/BF02403999zbMATH Open0851.90091OpenAlexW4250243394MaRDI QIDQ1918984FDOQ1918984
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
Cites Work
- Title not available (Why is that?)
- Constrained global optimization: algorithms and applications
- 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
- On the global minimization of concave functions
- Multidimensional bisection applied to global optimisation
- Outer approximation by polyhedral convex sets
- Post algebras as semantic bases of some many-valued logics
Cited In (16)
- An Algorithm for Maximizing a Convex Function Based on Its Minimum
- Global optimization approach to Malfatti's problem
- A global optimization approach for solving non-monotone variational inequality problems
- Global optimization reduction of generalized Malfatti's problem
- A new algorithm for minimizing convex functions over convex sets
- Piece adding technique for convex maximization problems
- Solving Malfatti's high dimensional problem by global optimization
- Global search method for solving Malfatti's four-circle problem
- A maximization algorithm of pseudo-convex quadratic functions
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- Generalized Nash equilibrium problem based on Malfatti's problem
- Lipschitz programming via increasing convex-along-rays functions*
- A numerical approach for solving some convex maximization problems
- Global minimization algorithms for concave quadratic programming problems
- Covering balls and \(\mathcal{HT}\)-\textit{differential} for convex maximization
- Inscribed ball and enclosing box methods for the convex maximization problem
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- A new algorithm for minimizing convex functions over convex sets 👍 👎
- An algorithm to solve polyhedral convex set optimization problems 👍 👎
- Maximizing a concave function over the efficient or weakly-efficient set 👍 👎
- An algorithm for constrained convex optimization 👍 👎
- A simple randomised algorithm for convex optimisation 👍 👎
- A Randomized Algorithm to Optimize Over Certain Convex Sets 👍 👎
- Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron 👍 👎
- An Algorithm for Maximizing a Convex Function Based on Its Minimum 👍 👎
This page was built for publication: An algorithm for maximizing a convex function over a simple set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918984)
