The following pages link to (Q5453761):
Displayed 10 items.
- A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization (Q342520) (← links)
- Solving DC programs using the cutting angle method (Q486726) (← links)
- Challenges of continuous global optimization in molecular structure prediction (Q877606) (← links)
- Aggregation functions based on penalties (Q969571) (← links)
- Bounded lower subdifferentiability optimization techniques: applications (Q975769) (← links)
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
- Interpolation of Lipschitz functions (Q2499791) (← links)
- Comparative study of RPSALG algorithm for convex semi-infinite programming (Q2515065) (← links)
- Generalized cutting plane method for solving nonlinear stochastic programming problems (Q5131826) (← links)
- Robust aggregation of compositional and interval-valued data: the mode on the unit simplex (Q6079430) (← links)