Pages that link to "Item:Q1177911"
From MaRDI portal
The following pages link to Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911):
Displayed 28 items.
- A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
- Linearization method for a class of multiplicative programming with exponent (Q864775) (← links)
- Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) (← links)
- A new rectangle branch-and-pruning approach for generalized geometric programming (Q865546) (← links)
- Global optimization for sum of linear ratios problem using new pruning technique (Q1023182) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
- A global optimization approach for the linear two-level program (Q1207038) (← links)
- A quasiconcave minimization method for solving linear two-level programs (Q1318264) (← links)
- Simplicially-constrained DC optimization over efficient and weakly efficient sets (Q1411519) (← links)
- Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
- A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
- Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
- Subdivision of simplices relative to a cutting plane and finite concave minimization (Q1817320) (← links)
- A d.c. optimization method for single facility location problems (Q1904649) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- A convergent conical algorithm with \(\omega \)-bisection for concave minimization (Q2018479) (← links)
- Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
- A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
- On the exhaustivity of simplicial partitioning (Q2442641) (← links)
- A global optimization algorithm using linear relaxation (Q2507847) (← links)
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms (Q2564625) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- Optimization over equilibrium sets<sup>∗</sup> (Q2710390) (← links)
- Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program (Q3553752) (← links)
- Minimizing the sum of a convex function and a specially structured nonconvex function (Q3835636) (← links)
- On geometry and convergence of a class of simplicial covers (Q4327931) (← links)
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925734) (← links)