Pages that link to "Item:Q5927651"
From MaRDI portal
The following pages link to A new approach to optimization under monotonic constraint (Q5927651):
Displaying 12 items.
- A partial enumeration algorithm for pure nonlinear integer programming (Q838194) (← links)
- Reverse convex problems: an approach based on optimality conditions (Q868408) (← links)
- Convexification of nonsmooth monotone functions (Q933812) (← links)
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint (Q987514) (← links)
- Branch-and-reduce algorithm for convex programs with additional multiplicative constraints (Q1042085) (← links)
- Representability of functions (Q1825755) (← links)
- A branch-and-bound based method for solving monotone optimization problems (Q2501119) (← links)
- Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems (Q2576243) (← links)
- On convexification for a class of global optimization problems (Q2676158) (← links)
- (Q3119209) (← links)
- Matrix-Monotonic Optimization $-$ Part I: Single-Variable Optimization (Q5103336) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5307224) (← links)