An interval algorithm for constrained global optimization
An interval arithmetic method for solving the global constrained problem \(\min f(x)\), \(g(x)= 0\), \(h(x)\leq 0\) is presented which shows the following features: (i) The problem is transformed to a penalty approach, \(\min F(x)\) with \(F= f+ cp\) and \(c\) being the penalty factor and \(p\) the \(L_ 1\)-exact penalty term. (ii) Numerical experience and computational results suggest the choice of a factor \(c\geq \bar c\), where \(\bar c= O(\max| f(x)|)\). Then the computation is rather insensitive to changes of \(c\). However, the value of \(\bar c\) has not been exploited completely yet. (iii) Additionally, infeasible areas \(Y\) are discarded during the computation using appropriate interval arithmetic exclusion tests.
- Augmentability in optimization theory
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 4062487 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 3438635 (Why is no real title available?)
- scientific article; zbMATH DE number 3308855 (Why is no real title available?)
- On interval enclosures using slope arithmetic
- On proving existence of feasible points in equality constrained optimization problems
- An interval algorithm for nondifferentiable global optimization
- Numerical solution for bounding feasible point sets
- Interval mathematics, algebraic equations and optimization
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- A hybrid global optimization method: The multi-dimensional case
- Constructing large feasible suboptimal intervals for constrained nonlinear optimization
- Interval methods for global optimization
- Verification of constrained minima
- \textsc{Oscars}-II: an algorithm for bound constrained global optimization
- Feature extraction algorithms for constrained global optimization. II: Batch process scheduling application
- Interval-arithmetic-oriented interval computing technique for global optimization
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
- Dynamic optimization of interval narrowing algorithms
- scientific article; zbMATH DE number 1975073 (Why is no real title available?)
- scientific article; zbMATH DE number 2068082 (Why is no real title available?)
- scientific article; zbMATH DE number 818540 (Why is no real title available?)
- Some feasibility sampling procedures in interval methods for constrained global optimization
- scientific article; zbMATH DE number 6183018 (Why is no real title available?)
- Deterministic global optimization using interval constraint propagation techniques
- Efficient interval partitioning for constrained global optimization
This page was built for publication: An interval algorithm for constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334802)
