Constructing large feasible suboptimal intervals for constrained nonlinear optimization

DOI10.1007/BF02096403MaRDI QIDQ1904721zbMATH OpenFDO

Authors Tibor Csendes, Zelda B. Zabinsky, Birna P. Kristinsdottir

Publication date 1 February 1996

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

sensitivity analysisconstrained global optimizationconstrained nonlinear optimizationinclusion functionlarge feasible \(n\)-dimensional interval

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• scientific article; zbMATH DE number 804618
• Some feasibility sampling procedures in interval methods for constrained global optimization
• scientific article; zbMATH DE number 818540
• An interval algorithm for constrained global optimization
• Efficient interval partitioning for constrained global optimization

Cites work

• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 3936378 (Why is no real title available?)
• scientific article; zbMATH DE number 52928 (Why is no real title available?)
• scientific article; zbMATH DE number 804618 (Why is no real title available?)
• A collection of test problems for constrained global optimization algorithms
• A new interval method for locating the boundary of level sets
• An interval branch and bound algorithm for bound constrained optimization problems
• An interval method for bounding level sets of parameter estimation problems
• Constrained global optimization: algorithms and applications
• Experiments using interval analysis for solving a circuit design problem
• FORTRAN-SC. A study of a FORTRAN extension for engineering/scientific computation with access to ACRITH
• Interval method for bounding level sets: Revisited and tested with global optimization problems
• Sensitivity analysis for nonlinear programming using penalty methods
• The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming

Cited in

(4)

• OPTIMIZATION AND THE MIRANDA APPROACH IN DETECTING HORSESHOE-TYPE CHAOS BY COMPUTER
• A verified optimization technique to locate chaotic regions of Hénon systems
• Allocation of limited resources under quadratic constraints
• Some feasibility sampling procedures in interval methods for constrained global optimization

Describes a project that uses

Uses Software

• C-XSC 2.0
• C-XSC

This page was built for publication: Constructing large feasible suboptimal intervals for constrained nonlinear optimization

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