Global minimization using an augmented Lagrangian method with variable lower-level constraints
Publication:1960193
DOI10.1007/S10107-009-0264-YzbMath1198.90322OpenAlexW2075572180MaRDI QIDQ1960193
Ernesto G. Birgin, José Mario Martínez, Christodoulos A. Floudas
Publication date: 13 October 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0264-y
algorithmsnumerical experimentsdeterministic global optimizationnonlinear programmingaugmented Lagrangians
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items (66)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A global optimization RLT-based approach for solving the fuzzy clustering problem
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Practical bilevel optimization. Algorithms and applications
- Global minimum potential energy conformations of small molecules
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- A comparison of complete global optimization solvers
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Complete solutions and extremality criteria to polynomial optimization problems
- Multiplier and gradient methods
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- A global optimization RLT-based approach for solving the hard clustering problem
- An interior point algorithm for global optimal solutions and KKT points
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Trust Region Methods
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- Reduction constraints for the global optimization of NLPs
- Biconvex Models and Algorithms for Risk Management Problems
- Complete search in continuous global optimization and constraint satisfaction
- Global Optimization and Constraint Satisfaction
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Global optimization of nonconvex factorable programming problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Global minimization using an augmented Lagrangian method with variable lower-level constraints