Pages that link to "Item:Q2706339"
From MaRDI portal
The following pages link to Monotonic Optimization: Problems and Solution Approaches (Q2706339):
Displayed 37 items.
- A new topological minimax theorem with application (Q548181) (← links)
- Global optimization for the generalized polynomial sum of ratios problem (Q548182) (← links)
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization (Q656831) (← links)
- Problems with resource allocation constraints and optimization over the efficient set (Q742138) (← links)
- Global optimization from concave minimization to concave mixed variational inequality (Q778156) (← links)
- Optimization of a quadratic function with a circulant matrix (Q853879) (← links)
- Convexification of nonsmooth monotone functions (Q933812) (← links)
- A robust algorithm for generalized geometric programming (Q934812) (← links)
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
- Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
- Nonconcave utility maximisation in the MIMO broadcast channel (Q965324) (← links)
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization (Q989898) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← 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)
- On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- Monotonic optimization for sensor cover energy problem (Q1800445) (← links)
- Monotonic optimization based decoding for linear codes (Q1941018) (← links)
- Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects (Q2040606) (← links)
- Relative entropy and envy-free allocation (Q2171250) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
- Conjugate duality and optimization over weakly efficient set (Q2398309) (← links)
- Continuous approximation of linear impulsive systems and a new form of robust stability (Q2405389) (← links)
- Some results on augmented Lagrangians in constrained global optimization via image space analysis (Q2435019) (← links)
- On a decomposition method for nonconvex global optimization (Q2463828) (← links)
- A novel approach to bilevel nonlinear programming (Q2465482) (← links)
- A branch-and-bound based method for solving monotone optimization problems (Q2501119) (← links)
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs (Q2502217) (← links)
- A nonisolated optimal solution for special reverse convex programming problems (Q2519714) (← links)
- Robust solution of nonconvex global optimization problems (Q2576450) (← links)
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
- On convexification for a class of global optimization problems (Q2676158) (← links)
- A class of convexification and concavification methods for non-monotone optimization problems (Q3534647) (← links)
- (Q5021865) (← links)
- Efficient presolving methods for the influence maximization problem (Q6139380) (← links)