Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints

DOI10.1007/S11750-011-0178-8zbMath1258.93102OpenAlexW2009014996MaRDI QIDQ1935885

Nikolaos V. Sahinidis, Satyajith Amaran

Publication date: 20 February 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-011-0178-8

zbMATH Keywords

global optimizationunconstrained optimizationparameter estimationnonlinear least-squares

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Numerical methods based on necessary conditions (49M05) Estimation and detection in stochastic control theory (93E10) Least squares and related methods for stochastic control systems (93E24)

Related Items (4)

Domain reduction techniques for global NLP and MINLP optimization ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs ⋮ Identification of mechanical properties of arteries with certification of global optimality

Uses Software

• Unnamed Item
• Unnamed Item
• INTOPT_90
• nlmdl

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rigorous global search: continuous problems
• Convex extensions and envelopes of lower semi-continuous functions
• Stochastic algorithms in nonlinear regression
• Introduction to the GiNaC framework for symbolic computation within the \(\text{C}^{++}\) programming language
• A polyhedral branch-and-cut approach to global optimization
• Integral global optimization method in statistical applications
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Product disaggregation in global optimization and relaxations of rational programs
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• BARON: A general purpose global optimization software package
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
• A server for automated performance analysis of benchmarking data
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Modified Damped Least Squares: An Algorithm for Non-linear Estimation

This page was built for publication: Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints