Results 11 to 20 of about 10,389,003 (244)
Accelerated Methods for Saddle-Point Problem
The paper deals with a class of smooth convex-concave saddle-point optimization problems with a special structure arising, e.g., in image processing and when solving various inverse problems. It is proposed to reduce the considered saddle-point problems to a combination of auxiliary minimization problems with smooth strongly convex functions that are ...
Alkousa, M. S. +4 more
openaire +4 more sources
Parallel Preconditioners for Saddle-Point Problems
Constraint preconditioners have proved very efficient for the solution of ill-conditioned saddle point problems in a sequential computing environment. Their implementation on parallel computers, however, is not straightforward because of their inherent sequentiality. The present paper describes a novel parallel inexact constraint preconditioner (ParICP)
FERRONATO, MASSIMILIANO +2 more
openaire +2 more sources
On a class of saddle point problems and convergence results
We consider an abstract mixed variational problem consisting of two inequalities. The first one is governed by a functional φ, possibly non-differentiable. The second inequality is governed by a nonlinear term depending on a non negative parameter ǫ.
Mariana Chivu Cojocaru, Andaluzia Matei
doaj +5 more sources
An alternating preconditioner for saddle point problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiao-Fei Peng, Wen Li 0006
openaire +4 more sources
The Saddle Point Problem of Polynomials [PDF]
AbstractThis paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre’s hierarchy of semidefinite relaxations. Under some genericity assumptions on defining polynomials, we show that: (i) if there exists a saddle point, our algorithm can get one by solving a finite ...
Jiawang Nie, Zi Yang, Guangming Zhou
openaire +4 more sources
Well-posed saddle point problems
Summary: We provide a new well-posedness concept for saddle-point problems. We characterize it by means of the behavior of the sublevel sets of an associated function. We then study the concave-convex case in Euclidean spaces. Applying these results in the setting of convex programming, we get a result on the convergence of the pair solution-Lagrange ...
CAPRARI E., LUCCHETTI, ROBERTO
openaire +3 more sources
Decentralized Distributed Optimization for Saddle Point Problems [PDF]
We consider distributed convex-concave saddle point problems over arbitrary connected undirected networks and propose a decentralized distributed algorithm for their solution.
Kovalev, Dmitry +6 more
core +1 more source
Decentralized distributed optimization for saddle point problems [PDF]
We consider distributed convex-concave saddle point problems over arbitrary connected undirected networks and propose a decentralized distributed algorithm for their solution.
Kovalev, Dmitry +5 more
core +3 more sources
Alternating Direction Method of Multipliers for Decomposable Saddle-Point Problems [PDF]
Saddle-point problems appear in various settings including machine learning, zero-sum stochastic games, and regression problems. We consider decomposable saddle-point problems and study an extension of the alternating direction method of multipliers to ...
Karabag, Mustafa O. +2 more
core +1 more source
Analysis of Preconditioners for Saddle-Point Problems [PDF]
Mixed finite element formulations give rise to large, sparse, block linear systems of equations, the solution of which is often sought via a preconditioned iterative technique. In this work we present a general analysis of block-preconditioners based on the stability conditions inherited from the formulation of the finite element method (the Babuska ...
Loghin, D, Wathen, A
openaire +3 more sources

