Global minimization using an augmented Lagrangian method with variable lower-level constraints
type: Item
instance of: scholarly article
title: Global minimization using an augmented Lagrangian method with variable lower-level constraints
zbMATH Open document ID: 1198.90322
author: E. G. Birgin
author: Christodoulos A. Floudas
author: J. M. Martínez
published in: Mathematical Programming. Series A. Series B
publication date: 2010-10-13T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5799377
zbMATH Keywords: deterministic global optimization
zbMATH Keywords: augmented Lagrangians
zbMATH Keywords: nonlinear programming
zbMATH Keywords: algorithms
zbMATH Keywords: numerical experiments
describes a project that uses: BARON
describes a project that uses: INTLIB
describes a project that uses: MINOS
MaRDI profile type: Publication
full work available at URL: s10107-009-0264-y
OpenAlex ID: W2075572180
cites work: On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
cites work: On the relation between constant positive linear dependence condition and quasinormality constraint qualification
cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints
cites work: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
cites work: Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
cites work: Large-scale active-set box-constrained optimization method with spectral projected gradients
cites work: Trust Region Methods
cites work: Benchmarking optimization software with performance profiles.
cites work: Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
cites work: Perfect duality theory and complete solutions to a class of global optimization problems*
cites work: Canonical duality theory and solutions to constrained nonconvex quadratic programming
cites work: Complete solutions and extremality criteria to polynomial optimization problems
cites work: Solutions and optimality criteria to box constrained nonconvex minimization problems
cites work: Multiplier and gradient methods
cites work: Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
cites work: Reduction constraints for the global optimization of NLPs
cites work: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
cites work: On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
cites work: Global minimum potential energy conformations of small molecules
cites work: Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
cites work: Complete search in continuous global optimization and constraint satisfaction
cites work: A comparison of complete global optimization solvers
cites work: An interior point algorithm for global optimal solutions and KKT points
cites work: Q5590418
cites work: Q5289009
cites work: A branch-and-reduce approach to global optimization
cites work: BARON: A general purpose global optimization software package
cites work: Global Optimization and Constraint Satisfaction
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: Biconvex Models and Algorithms for Risk Management Problems
cites work: A global optimization RLT-based approach for solving the hard clustering problem
cites work: A global optimization RLT-based approach for solving the fuzzy clustering problem
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
cites work: Global optimization of nonconvex factorable programming problems
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
DOI: 10.1007/S10107-009-0264-Y
description: scientific article; zbMATH DE number 5799377