Pages that link to "Item:Q1334802"
From MaRDI portal
The following pages link to An interval algorithm for constrained global optimization (Q1334802):
Displaying 20 items.
- Some feasibility sampling procedures in interval methods for constrained global optimization (Q506473) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- On proving existence of feasible points in equality constrained optimization problems (Q1290652) (← links)
- An interval algorithm for nondifferentiable global optimization (Q1335231) (← links)
- Numerical solution for bounding feasible point sets (Q1398432) (← links)
- Interval mathematics, algebraic equations and optimization (Q1593830) (← links)
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method (Q1810869) (← links)
- A hybrid global optimization method: The multi-dimensional case (Q1811602) (← links)
- Constructing large feasible suboptimal intervals for constrained nonlinear optimization (Q1904721) (← links)
- Interval methods for global optimization (Q1914643) (← links)
- Verification of constrained minima (Q1919423) (← links)
- \textsc{Oscars}-II: an algorithm for bound constrained global optimization (Q2022219) (← links)
- Feature extraction algorithms for constrained global optimization. II: Batch process scheduling application (Q2368103) (← links)
- Interval-arithmetic-oriented interval computing technique for global optimization (Q3433120) (← links)
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) (← links)
- Dynamic optimization of interval narrowing algorithms (Q4245938) (← links)
- (Q4424285) (← links)
- (Q4464691) (← links)
- (Q5301189) (← links)
- Deterministic global optimization using interval constraint propagation techniques (Q5693008) (← links)