Lagrangian-penalization algorithm for constrained optimization and variational inequalities
type: Item
instance of: scholarly article
title: Lagrangian-penalization algorithm for constrained optimization and variational inequalities
zbMATH Open document ID: 1261.65063
author: Pierre Frankel
author: Juan Peypouquet
published in: Set-Valued and Variational Analysis
publication date: 2012-09-20T00:00:00Z
full work available at URL: http://hdl.handle.net/10533/128322
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K15
Mathematics Subject Classification ID: 49J40
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 6084544
zbMATH Keywords: convex optimization
zbMATH Keywords: variational inequality
zbMATH Keywords: proximal methods
zbMATH Keywords: domain decomposition
zbMATH Keywords: predictor corrector proximal multiplier method
zbMATH Keywords: algorithm
describes a project that uses: PDCO
MaRDI profile type: Publication
OpenAlex ID: W1984438671
cites work: Q3530144
cites work: Variational Analysis in Sobolev andBVSpaces
cites work: Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
cites work: Prox-Penalization and Splitting Methods for Constrained Variational Problems
cites work: Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
cites work: Q3630252
cites work: Penalty-proximal methods in convex programming
cites work: Q4503250
cites work: Produits infinis de resolvantes
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: A proximal-based deomposition method for compositions method for convex minimization problems
cites work: Atomic Decomposition by Basis Pursuit
cites work: Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
cites work: Alternating proximal algorithm with costs-to-move, dual description and application to PDE's
cites work: Exact Regularization of Convex Programs
cites work: Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
cites work: Weak convergence of the sequence of successive approximations for nonexpansive mappings
cites work: Evolution equations for maximal monotone operators: asymptotic analysis in continuous and discrete time
cites work: Monotone Operators and the Proximal Point Algorithm
DOI: 10.1007/S11228-011-0199-3
Recommended article: Q5314381
Recommended article: Inexact proximal Newton methods for self-concordant functions
Recommended article: A globally linearly convergent method for pointwise quadratically supportable convex-concave saddle point problems
Recommended article: Inexact proximal point method for general variational inequalities
Recommended article: Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
Recommended article: Rescaled proximal methods for linearly constrained convex problems
Recommended article: A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis
Recommended article: Q4945773
Recommended article: An inexact proximal generalized alternating direction method of multipliers
Recommended article: Q4945772
description: scientific article; zbMATH DE number 6084544