The global and local convergence properties of a class of augmented Lagrangian methods for solving nonlinear programming problems are considered. In such methods, simple bound constraints are treated ...

Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...

This is a preview. Log in through your library . Abstract The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array ...