Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
\(\alpha BB\): A global optimization method for general constrained nonconvex problems
Multiplier and gradient methods
Practical bilevel optimization. Algorithms and applications
Global minimization using an augmented Lagrangian method with variable lower-level constraints
Second-order negative-curvature methods for box-constrained and general constrained optimization
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
Improving ultimate convergence of an augmented Lagrangian method
On Augmented Lagrangian Methods with General Lower-Level Constraints
Trust Region Methods
Two New Weak Constraint Qualifications and Applications
Derivative-free methods for nonlinear programming with general lower-level constraints
A relaxed constant positive linear dependence constraint qualification and applications
Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
A polyhedral branch-and-cut approach to global optimization
A Progressive Barrier for Derivative-Free Nonlinear Programming
Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
A review of recent advances in global optimization
Stochastic adaptive search for global optimization.
Canonical duality theory and solutions to constrained nonconvex quadratic programming
Complete solutions and extremality criteria to polynomial optimization problems
Convex analysis and global optimization
Introduction to global optimization.
Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
A comparison of complete global optimization solvers
Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
A branch-and-reduce approach to global optimization
Complete search in continuous global optimization and constraint satisfaction
Global optimization of nonconvex factorable programming problems
On solvability of convex noncoercive quadratic programming problems
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
Solutions and optimality criteria to box constrained nonconvex minimization problems
An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
Analysis and implementation of a dual algorithm for constrained optimization
On the relation between constant positive linear dependence condition and quasinormality constraint qualification
Large-scale active-set box-constrained optimization method with spectral projected gradients
Handling infeasibility in a large-scale nonlinear optimization algorithm
Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
Packing circles within ellipses
On sequential optimality conditions for smooth constrained optimization
Perfect duality theory and complete solutions to a class of global optimization problems*
A global optimization RLT-based approach for solving the hard clustering problem
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
Reduction constraints for the global optimization of NLPs
A practical general approximation criterion for methods of multipliers based on Bregman distances
On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
Biconvex Models and Algorithms for Risk Management Problems
On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
Outer trust-region method for constrained optimization
Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians
A global optimization RLT-based approach for solving the fuzzy clustering problem
An interior point algorithm for global optimal solutions and KKT points
Partial spectral projected gradient method with active-set strategy for linearly constrained optimization

Cited In (10)

Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
Convergence results of an augmented Lagrangian method using the exponential penalty function
Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
On the application of an augmented Lagrangian algorithm to some portfolio problems
Augmented Lagrangian methods for nonlinear programming with possible infeasibility
Optimality properties of an augmented Lagrangian method on infeasible problems
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
An infeasibility certificate for nonlinear programming based on Pareto criticality condition
An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities

Uses Software

BARON
INTLIB
TANGO
MINOS

Recommendations

This page was built for publication: Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742114)