Pages that link to "Item:Q5421799"
From MaRDI portal
The following pages link to Monotonic Optimization: Branch and Cut Methods (Q5421799):
Displayed 12 items.
- Algorithms for projecting a point onto a level surface of a continuous function on a compact set (Q889159) (← links)
- A robust algorithm for generalized geometric programming (Q934812) (← links)
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
- Nonconcave utility maximisation in the MIMO broadcast channel (Q965324) (← links)
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization (Q989898) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- Solving sum of quadratic ratios fractional programs via monotonic function (Q1026289) (← links)
- Global minimization for generalized polynomial fractional program (Q1718667) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- On a decomposition method for nonconvex global optimization (Q2463828) (← links)
- A novel approach to bilevel nonlinear programming (Q2465482) (← links)
- A nonisolated optimal solution for special reverse convex programming problems (Q2519714) (← links)