The Primal-Dual Active Set Strategy as a Semismooth Newton Method

  title={The Primal-Dual Active Set Strategy as a Semismooth Newton Method},
  author={Michael Hinterm{\"u}ller and Kazufumi Ito and Karl Kunisch},
  journal={SIAM J. Optim.},
This paper addresses complementarity problems motivated by constrained optimal control problems. It is shown that the primal-dual active set strategy, which is known to be extremely efficient for this class of problems, and a specific semismooth Newton method lead to identical algorithms. The notion of slant differentiability is recalled and it is argued that the $\max$-function is slantly differentiable in Lp-spaces when appropriately combined with a two-norm concept. This leads to new local… 

Tables from this paper

The Primal-Dual Active Set Method for Nonlinear Optimal Control Problems with Bilateral Constraints

The primal-dual active set method has proved to be an efficient numerical tool in the context of diverse applications. So far it has been investigated mainly for linear problems. This paper is

The Primal-Dual Active Set Method for a Class of Nonlinear Problems with T-Monotone Operators

The family of primal-dual active set methods is drawing more attention in scientific and engineering applications due to its effectiveness and robustness for variational inequality problems. In this

Applications of Semi-smooth Newton Methods to Variational Inequalities

This paper discusses semi-smooth Newton methods for solving nonlinear non-smooth equations in Banach spaces. Such investigations are motivated by complementarity problems, variational inequalities

Primal-dual active set method for control constrained optimal control of the Stokes equations

This paper studies the distributed and boundary optimal control of the Stokes equations in the presence of pointwise control constraints with primal–dual active set strategy for the numerical solution of the problems.

An Adaptive Penalty Method for Inequality Constrained Minimization Problems

The adaptive penalty method (APM) therewith combines the main advantages of both methods, namely the ease of implementation of penalty methods and the exact imposition of inequality constraints inherent to the active set method.

Preconditioning for active set and projected gradient methods assemi-smooth Newton methods for PDE-constrained optimization with control constraints

This paper proposes preconditioners for the saddle point problems that arise when a primal-dual active set method is used and shows for this method that the same saddle point system can be derived when the method is considered as a semi-smooth Newton method.

A recursive semi-smooth Newton method for linear complementarity problems∗

A primal feasible active set method is presented for finding the unique solution of a Linear Complementarity Problem (LCP) with a P -matrix, which extends the globally convergent active set method

On a semi-smooth Newton method and its globalization

This paper addresses the globalization of the semi-smooth Newton method for non-smooth equations F(x)  =  0 in $${\mathbb{R}}^m$$ with applications to complementarity and discretized

Primal–dual active set method for control constrained optimal control of the Stokes equations

In this paper, we study the distributed and boundary optimal control of the Stokes equations in the presence of pointwise control constraints. The analysis of the problems involve existence results,

An Efficient Primal-Dual Method for the Obstacle Problem

The derivation of this method is disciplined, relying on a saddle point formulation of the convex problem, and can be adapted to a wide range of other constrained convex optimization problems.



A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions

  • H. Qi
  • Mathematics
    SIAM J. Optim.
  • 2000
Under CD-regularity, this work proves that the proposed regularized smoothing Newton method for the box constrained variational inequality problem with P0-function has a superlinear (quadratic) convergence rate without requiring strict complementarity conditions.

Primal-Dual Strategy for Constrained Optimal Control Problems

An algorithm for efficient solution of control constrained optimal control problems is proposed and analyzed. It is based on an active set strategy involving primal as well as dual variables. For

A Comparison of a Moreau-Yosida-Based Active Set Strategy and Interior Point Methods for Constrained Optimal Control Problems

The main purpose is a comparison between a recently developed Moreau--Yosida-based active set strategy involving primal and dual variables and two implementations of interior point algorithms.

Newton's Method for a Class of Weakly Singular Optimal Control Problems

This work considers the case where neither the linearization of the equality constraint e characterizing the differential equation is surjective nor a second order sufficient optimality condition holds for the topology on which e is well defined.

Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds

A superlinearly convergent affine-scaling interior-point Newton method for infinite-dimensional problems with pointwise bounds in Lp-space is developed and it is demonstrated in an example that a stepsize rule to obtain an interior iterate may require very small stepsizes even arbitrarily close to a nondegenerate solution.

Semismooth Newton Methods for Operator Equations in Function Spaces

A Newton-like method for nonsmooth operator equations is developed and its local q-superlinear convergence to regular solutions is proved, and the semismoothness of composite operators is established and corresponding chain rules are developed.

Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations

  • L. Qi
  • Mathematics
    Math. Oper. Res.
  • 1993
Convergence analysis of some algorithms for solving systems of nonlinear equations defined by locally Lipschitzian functions and a hybrid method, which is both globally convergent in the sense of finding a stationary point of the norm function of the system and locally quadratically convergent, is presented.

A nonsmooth version of Newton's method

It is shown that the gradient function of the augmented Lagrangian forC2-nonlinear programming is semismooth, and the extended Newton's method can be used in the augmentedlagrangian method for solving nonlinear programs.

A Simply Constrained Optimization Reformulation of KKT Systems Arising from Variational Inequalities

It is proved that, under fairly mild assumptions, every stationary point of this constrained minimization problem is a solution of the KKT conditions.

Semismooth and Semiconvex Functions in Constrained Optimization

We introduce semismooth and semiconvex functions and discuss their properties with respect to nonsmooth nonconvex constrained optimization problems. These functions are locally Lipschitz, and hence