Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
type: Item
instance of: scholarly article
title: Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
zbMATH Open document ID: 1321.90106
author: E. G. Birgin
author: L. F. Prudente
author: J. M. Martínez
published in: Journal of Global Optimization
publication date: 2014-09-18T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6345491
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: TANGO
describes a project that uses: MINOS
MaRDI profile type: Publication
full work available at URL: s10898-013-0039-0
OpenAlex ID: W2111920137
cites work: On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
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: Second-order negative-curvature methods for box-constrained and general constrained optimization
cites work: On sequential optimality conditions for smooth constrained optimization
cites work: A relaxed constant positive linear dependence constraint qualification and applications
cites work: Two New Weak Constraint Qualifications and Applications
cites work: On the relation between constant positive linear dependence condition and quasinormality constraint qualification
cites work: A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
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: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Packing circles within ellipses
cites work: Outer trust-region method for constrained optimization
cites work: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
cites work: The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
cites work: Global minimization using an augmented Lagrangian method with variable lower-level constraints
cites work: Large-scale active-set box-constrained optimization method with spectral projected gradients
cites work: Improving ultimate convergence of an augmented Lagrangian method
cites work: Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
cites work: Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians
cites work: Trust Region Methods
cites work: Derivative-free methods for nonlinear programming with general lower-level constraints
cites work: On solvability of convex noncoercive quadratic programming problems
cites work: Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
cites work: A practical general approximation criterion for methods of multipliers based on Bregman distances
cites work: A review of recent advances in global optimization
cites work: A branch-and-reduce approach to global optimization
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: Analysis and implementation of a dual algorithm for constrained optimization
cites work: Multiplier and gradient methods
cites work: Introduction to global optimization.
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: Q5492526
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: Handling infeasibility in a large-scale nonlinear optimization algorithm
cites work: A polyhedral branch-and-cut approach to global optimization
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: Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
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

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (cites work)
cites work: Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (cites work)
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (cites work)
cites work: Convex analysis and global optimization

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (cites work)
cites work: Stochastic adaptive search for global optimization.

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (DOI)
DOI: 10.1007/S10898-013-0039-0

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: Augmented Lagrangian methods for nonlinear programming with possible infeasibility
Similarity Score: 0.9509715
Recommender Run: Recommender Run 3

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: Optimality properties of an augmented Lagrangian method on infeasible problems
Similarity Score: 0.919819
Recommender Run: Recommender Run 3

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: Generalized augmented Lagrangian problem and approximate optimal solutions in nonlinear programming
Similarity Score: 0.91337574
Recommender Run: Recommender Run 3

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: Augmented lagrangians in semi-infinite programming
Similarity Score: 0.9121352
Recommender Run: Recommender Run 3

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: Q5480813
Similarity Score: 0.90818936
Recommender Run: Recommender Run 3

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: Q4524227
Similarity Score: 0.90563506
Recommender Run: Recommender Run 3

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: Q5755347
Similarity Score: 0.9053877
Recommender Run: Recommender Run 3

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: An augmented Lagrangian algorithm for solving semiinfinite programming
Similarity Score: 0.90363604
Recommender Run: Recommender Run 3

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
Similarity Score: 0.9012952
Recommender Run: Recommender Run 3

Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Recommended article)
Recommended article: On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
Similarity Score: 0.8993013
Recommender Run: Recommender Run 3