Pages that link to "Item:Q3494393"
From MaRDI portal
The following pages link to Deterministic methods in constrained global optimization: Some recent advances and new fields of application (Q3494393):
Displaying 27 items.
- A one-parameter filled function for nonsmooth global optimization and its application (Q545434) (← links)
- Convexification and concavification for a general class of global optimization problems (Q556003) (← links)
- An interactive multiobjective nonlinear programming procedure (Q684339) (← links)
- Set partition by globally optimized cluster seed points (Q809887) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- A filled function method for constrained global optimization (Q925228) (← links)
- Criteria for unconstrained global optimization (Q927205) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
- Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves (Q1201903) (← links)
- Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
- A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
- Global optimization in biology and medicine (Q1339853) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- Progress payments in project scheduling problems. (Q1812008) (← links)
- A global optimization algorithm for linear fractional and bilinear programs (Q1890945) (← links)
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
- A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
- Algorithms to solve some problems of concave programming with linear constraints (Q2371599) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- A NOVEL MONOTONIZATION TRANSFORMATION FOR SOME CLASSES OF GLOBAL OPTIMIZATION PROBLEMS (Q5487849) (← links)
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
