Pages that link to "Item:Q2560772"
From MaRDI portal
The following pages link to Nonlinear programming using minimax techniques (Q2560772):
Displaying 17 items.
- Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems (Q522420) (← links)
- An exact penalty function algorithm for semi-infinite programmes (Q751775) (← links)
- Solution of minimax problems using equivalent differentiable functions (Q1068355) (← links)
- Discrete minimax problem: Algorithms and numerical comparisons (Q1157881) (← links)
- Yield design theory: An efficient static method formulation (Q1286039) (← links)
- Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
- A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
- A simplex grey wolf optimizer for solving integer programming and minimax problems (Q2402871) (← links)
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems (Q2435021) (← links)
- Memetic particle swarm optimization (Q2468766) (← links)
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications (Q3851986) (← links)
- Optimization of electrical circuits (Q3858061) (← links)
- Nonlinear leastpth optimization and nonlinear programming (Q4152045) (← links)
- A lower bound for the controlling parameters of the exact penalty functions (Q4178795) (← links)
- A new algorithm for minimax and<i>l</i><sub>1</sub>-norm optimization (Q4944416) (← links)
- Direct Gravitational Search Algorithm for Global Optimisation Problems (Q5372051) (← links)
- The minimax exact penalty fuzzy function method for solving convex nonsmooth optimization problems with fuzzy objective functions (Q6065158) (← links)