DeepAI AI Chat
Log In Sign Up

A primal dual projection algorithm for efficient constraint preconditioning

by   Anton Schiela, et al.

We consider a linear iterative solver for large scale linearly constrained quadratic minimization problems that arise, for example, in optimization with PDEs. By a primal-dual projection (PDP) iteration, which can be interpreted and analysed as a gradient method on a quotient space, the given problem can be solved by computing sulutions for a sequence of constrained surrogate problems, projections onto the feasible subspaces, and Lagrange multiplier updates. As a major application we consider a class of optimization problems with PDEs, where PDP can be applied together with a projected cg method using a block triangular constraint preconditioner. Numerical experiments show reliable and competitive performance for an optimal control problem in elasticity.


A nonsmooth primal-dual method with simultaneous adaptive PDE constraint solver

We introduce an efficient first-order primal-dual method for the solutio...

Inexact Primal-Dual Gradient Projection Methods for Nonlinear Optimization on Convex Set

In this paper, we propose a novel primal-dual inexact gradient projectio...

Competitive Mirror Descent

Constrained competitive optimization involves multiple agents trying to ...

Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study

This paper proposes a method for construction of approximate feasible pr...

Primal-dual optimization methods for large-scale and distributed data analytics

The augmented Lagrangian method (ALM) is a classical optimization tool t...

Self-Supervised Primal-Dual Learning for Constrained Optimization

This paper studies how to train machine-learning models that directly ap...

Random matrix approach for primal-dual portfolio optimization problems

In this paper, we revisit the portfolio optimization problems of the min...