Pages that link to "Item:Q4467168"
From MaRDI portal
The following pages link to Geometry and combinatorics of the cutting angle method (Q4467168):
Displaying 14 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)
- Learning weights in the generalized OWA operators (Q812432) (← links)
- Challenges of continuous global optimization in molecular structure prediction (Q877606) (← 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)
- Absorbent tuples of aggregation operators (Q2372298) (← links)
- Interpolation of Lipschitz functions (Q2499791) (← links)
- Comparative study of RPSALG algorithm for convex semi-infinite programming (Q2515065) (← links)
- Cutting angle method – a tool for constrained global optimization (Q3156719) (← links)
- Generalized cutting plane method for solving nonlinear stochastic programming problems (Q5131826) (← links)
- POINTWISE CONSTRUCTION OF LIPSCHITZ AGGREGATION OPERATORS WITH SPECIFIC PROPERTIES (Q5297797) (← links)
- Implementation of novel methods of global and nonsmooth optimization: GANSO programming library (Q5426958) (← links)
- Geometry of cuts and metrics (Q5906765) (← links)