Pages that link to "Item:Q1899195"
From MaRDI portal
The following pages link to Introduction to global optimization (Q1899195):
Displayed 11 items.
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925734) (← links)
- Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925735) (← links)
- Generalized quasilinearization for quasilinear parabolic equations with nonlinearities of DC type (Q5942343) (← links)
- A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)
- Inscribed ball and enclosing box methods for the convex maximization problem (Q5963240) (← links)
- A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination (Q6057248) (← links)
- A novel one-parameter filled function method with an application to pathological analysis (Q6124343) (← links)
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization (Q6183089) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework (Q6200381) (← links)