Preprint ANL / MCS - P 793 - 0200 NONLINEAR PROGRAMS WITH UNBOUNDED LAGRANGEMULTIPLIER
نویسنده
چکیده
We investigate nonlinear programs that have a nonempty but possibly unbounded Lagrange multiplier set and that satisfy the quadraticgrowth condition. We show that such programs can be transformed, by relaxing the constraints and adding a linear penalty term to the objective function, into equivalent nonlinear programs that have diierentiable data and a bounded Lagrange multiplier set and that satisfy the quadratic growth condition. As a result we can deene, for this type of problem, algorithms that are linearly convergent, using only rst-order information, and superlinearly convergent.
منابع مشابه
Preprint ANL/MCS-P795-0200 NONLINEAR PROGRAMS WITH UNBOUNDED LAGRANGE MULTIPLIER SETS
We investigate nonlinear programs that have a nonempty but possibly unbounded Lagrange multiplier set and that satisfy the quadratic growth condition. We show that such programs can be transformed, by relaxing the constraints and adding a linear penalty term to the objective function, into equivalent nonlinear programs that have differentiable data and a bounded Lagrange multiplier set and that...
متن کاملOn parallelizing dual decomposition in stochastic integer programming
Preprint ANL/MCS-P3037-0912 For stochastic mixed-integer programs, we revisit the dual decomposition algorithm of Carøe and Schultz from a computational perspective with the aim of its parallelization. We address an important bottleneck of parallel execution by identifying a formulation that permits the parallel solution of the master program by using structure-exploiting interior-point solvers...
متن کاملPreprint ANL/MCS-P1641-0609. ON-LINE NONLINEAR PROGRAMMING AS A GENERALIZED EQUATION
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in online nonlinear programming by casting this as a generalized equation. We demonstrate that if points along a solution manifold are consistently strongly regular, it is possible to track the manifold approximately by solving a single linear complementarity problem (LCP) at each time step. We derive s...
متن کاملPreprint ANL/MCS-P1888-0511 DIFFERENCE FILTER PRECONDITIONING FOR LARGE COVARIANCE MATRICES
In many statistical applications one must solve linear systems corresponding to large, dense, and possibly irregularly structured covariance matrices. These matrices are often illconditioned; for example, the condition number increases at least linearly with respect to the size of the matrix when observations of a random process are obtained from a fixed domain. This paper discusses a precondit...
متن کاملMixed-Integer Nonlinear Optimization
Many optimal decision problems in scientific, engineering, and public sector applications involve both discrete decisions and nonlinear system dynamics that affect the quality of the final design or plan. These decision problems lead to mixed-integer nonlinear programming (MINLP) problems that combine the combinatorial difficulty of optimizing over discrete variable sets with the challenges of ...
متن کامل