Pages that link to "Item:Q1918984"
From MaRDI portal
The following pages link to An algorithm for maximizing a convex function over a simple set (Q1918984):
Displaying 14 items.
- Global optimization approach to Malfatti's problem (Q276503) (← links)
- Solving Malfatti's high dimensional problem by global optimization (Q317131) (← links)
- Global search method for solving Malfatti's four-circle problem (Q326276) (← links)
- Piece adding technique for convex maximization problems (Q604949) (← links)
- Generalized Nash equilibrium problem based on Malfatti's problem (Q2061338) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- Global optimization reduction of generalized Malfatti's problem (Q2358905) (← links)
- A numerical approach for solving some convex maximization problems (Q2505559) (← links)
- Global minimization algorithms for concave quadratic programming problems (Q3534648) (← links)
- A global optimization approach for solving non-monotone variational inequality problems (Q3646094) (← links)
- Lipschitz programming via increasing convex-along-rays functions<sup>*</sup> (Q4700278) (← links)
- An Algorithm for Maximizing a Convex Function Based on Its Minimum (Q5060795) (← links)
- Inscribed ball and enclosing box methods for the convex maximization problem (Q5963240) (← links)
- A maximization algorithm of pseudo-convex quadratic functions (Q6189572) (← links)
