Pages that link to "Item:Q1812071"
From MaRDI portal
The following pages link to Fast algorithm for the cutting angle method of global optimization (Q1812071):
Displayed 15 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)
- Bounded lower subdifferentiability optimization techniques: applications (Q975769) (← links)
- Least squares splines with free knots: Global optimization approach. (Q1426188) (← links)
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) (Q1433467) (← links)
- Globally optimal solutions of max-min systems (Q2426673) (← links)
- Interpolation of Lipschitz functions (Q2499791) (← links)
- Comparative study of RPSALG algorithm for convex semi-infinite programming (Q2515065) (← links)
- Local optimization method with global multidimensional search (Q2576444) (← links)
- Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY (Q2999550) (← links)
- Cutting angle method – a tool for constrained global optimization (Q3156719) (← links)
- Comparative analysis of the cutting angle and simulated annealing methods in global optimization (Q4467167) (← links)
- Geometry and combinatorics of the cutting angle method (Q4467168) (← links)
- A multidimensional descent method for global optimization (Q5193141) (← links)