Pages that link to "Item:Q4884046"

The following pages link to An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions (Q4884046):

Displayed 13 items.

• Algorithms with adaptive smoothing for finite minimax problems (Q597184) ‎ (← links)
• On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems (Q812415) ‎ (← links)
• Efficient interval partitioning for constrained global optimization (Q956597) ‎ (← links)
• A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) ‎ (← links)
• Approximation in normed linear spaces (Q1587393) ‎ (← links)
• Numerical experiments in semi-infinite programming (Q1816403) ‎ (← links)
• Deriving priorities from fuzzy pairwise comparison judgements (Q1873186) ‎ (← links)
• On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) ‎ (← links)
• Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) ‎ (← links)
• A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) ‎ (← links)
• Investigating a hybrid simulated annealing and local search algorithm for constrained optimization (Q2464206) ‎ (← links)
• Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization (Q3423591) ‎ (← links)
• Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) ‎ (← links)