DeepAI AI Chat
Log In Sign Up

A Julia implementation of Algorithm NCL for constrained optimization

by   Ding Ma, et al.

Algorithm NCL is designed for general smooth optimization problems where first and second derivatives are available, including problems whose constraints may not be linearly independent at a solution (i.e., do not satisfy the LICQ). It is equivalent to the LANCELOT augmented Lagrangian method, reformulated as a short sequence of nonlinearly constrained subproblems that can be solved efficiently by IPOPT and KNITRO, with warm starts on each subproblem. We give numerical results from a Julia implementation of Algorithm NCL on tax policy models that do not satisfy the LICQ, and on nonlinear least-squares problems and general problems from the CUTEst test set.


page 1

page 2

page 3

page 4


Implementing a smooth exact penalty function for general constrained nonlinear optimization

We build upon Estrin et al. (2019) to develop a general constrained nonl...

Implementing a smooth exact penalty function for equality-constrained nonlinear optimization

We develop a general equality-constrained nonlinear optimization algorit...

Fail-safe optimization of viscous dampers for seismic retrofitting

This paper presents a new optimization approach for designing minimum-co...

A Differentiable Augmented Lagrangian Method for Bilevel Nonlinear Optimization

Many problems in modern robotics can be addressed by modeling them as bi...

Inequality Constrained Stochastic Nonlinear Optimization via Active-Set Sequential Quadratic Programming

We study nonlinear optimization problems with stochastic objective and d...

Multi-constrained topology optimization via the topological sensitivity

The objective of this paper is to introduce and demonstrate a robust met...

The augmented Lagrangian method as a framework for stabilised methods in computational mechanics

In this paper we will review recent advances in the application of the a...