Univariate algorithms for solving global optimization problems with multiextremal non-differentiable constraints

MaRDI QIDQ2836305zbMATH OpenFDO

Authors Falah M. H. Khalaf, Yaroslav D. Sergeyev, Dmitri E. Kvasov

Publication date 2 July 2013

zbMATH Keywords

geometric algorithmsglobal optimizationindex schememultiextremal constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
• Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
• An algorithm for solving global optimization problems with nonlinear constraints
• Test problems for Lipschitz univariate global optimization with multiextremal constraints
• Univariate geometric Lipschitz global optimization algorithms

Cited in

(13)

• Reduction of multi-extremum multi-criterion problems with constraints to unconstrained optimization problems: Theory and algorithms
• Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints
• Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
• Triality theory for general unconstrained global optimization problems
• An algorithm for solving global optimization problems with nonlinear constraints
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
• On the least-squares fitting of data by sinusoids
• Test problems for Lipschitz univariate global optimization with multiextremal constraints
• Univariate geometric Lipschitz global optimization algorithms
• A one-step worst-case optimal algorithm for bi-objective univariate optimization
• On the convergence of the index algorithm in problems of conditional global optimization with -reserved solutions.
• Global optimization method of multivariate non-Lipschitz functions using tangent minorants
• Univariate global optimization with multiextremal non-differentiable constraints without penalty functions

This page was built for publication: Univariate algorithms for solving global optimization problems with multiextremal non-differentiable constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836305)