Pages that link to "Item:Q1124665"
From MaRDI portal
The following pages link to The complexity of the computation of a global minimum in certain classes of optimization problems (Q1124665):
Displaying 7 items.
- Estimating the characteristics of the accuracy and computational complexity in approximate methods of global optimization of nonlinear functionals (Q466015) (← links)
- On complexity of a global optimization problem (Q928586) (← links)
- Area-time complexity of the unconstrained minimization problem (Q1087137) (← links)
- Estimating the information complexity of global optimization and the global solution of equations (Q1311575) (← links)
- Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy (Q1364062) (← links)
- Complexity of general continuous minimization problems: a survey (Q5717540) (← links)
- Global optimization: On pathlengths in min-max graphs (Q5928206) (← links)