Bounds for Lagrange multipliers and optimal points
DOI10.1016/0898-1221(93)90282-ZzbMATH Open0795.90064MaRDI QIDQ1802498FDOQ1802498
Authors: Eldon R. Hansen, G. William Walster
Publication date: 4 September 1994
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Recommendations
- Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs
- Computable error bounds for an optimization problem with parallelepiped constraint
- Error bounds for generalized Lagrange multipliers in locally Lipschitz programming
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems
- scientific article; zbMATH DE number 3870082
global optimizationLagrange multipliersguaranteed boundsFritz-John conditionsconstrained nononvex optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Miscellaneous topics in calculus of variations and optimal control (49N99)
Cites Work
- Title not available (Why is that?)
- Global optimization using interval analysis - the multi-dimensional case
- Bounding solutions of systems of equations using interval analysis
- Nonlinear equations and optimization
- Interval forms of Newtons method
- Title not available (Why is that?)
- On Solving Systems of Equations Using Interval Arithmetic
- Title not available (Why is that?)
- Global optimization with data perturbations
- Computable error bounds for nonlinear programming
- Bounding Global Minima with Interval Arithmetic
- Bounding Global Minima
Cited In (12)
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- Augmented Lagrangian optimization under fixed-point arithmetic
- Title not available (Why is that?)
- Nonlinear equations and optimization
- On the Optimality and Limitations of Buehler Bounds
- First order rejection tests for multiple-objective optimization
- Interval mathematics, algebraic equations and optimization
- Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs
- A note on Lagrange multipliers with several binding constraints
- Title not available (Why is that?)
- The Lagrange method and SAO with bounds on the dual variables
This page was built for publication: Bounds for Lagrange multipliers and optimal points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802498)