Lagrangian-penalization algorithm for constrained optimization and variational inequalities
DOI10.1007/S11228-011-0199-3zbMATH Open1261.65063OpenAlexW1984438671MaRDI QIDQ452269FDOQ452269
Authors: Pierre Frankel, Juan Peypouquet 
Publication date: 20 September 2012
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/128322
Recommendations
- scientific article; zbMATH DE number 2202145
- Inexact proximal Newton methods for self-concordant functions
- A globally linearly convergent method for pointwise quadratically supportable convex-concave saddle point problems
- Inexact proximal point method for general variational inequalities
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- Rescaled proximal methods for linearly constrained convex problems
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis
- Publication:4945773
- An inexact proximal generalized alternating direction method of multipliers
- scientific article; zbMATH DE number 1424525
convex optimizationalgorithmdomain decompositionvariational inequalityproximal methodspredictor corrector proximal multiplier method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Variational inequalities (49J40) Decomposition methods (49M27) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Atomic Decomposition by Basis Pursuit
- Stable signal recovery from incomplete and inaccurate measurements
- A proximal-based deomposition method for compositions method for convex minimization problems
- Variational Analysis in Sobolev andBVSpaces
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Produits infinis de resolvantes
- Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
- Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
- Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Exact Regularization of Convex Programs
- Augmented Lagrangian and proximal alternating direction methods of multipliers in Hilbert spaces. Applications to games, PDE's and control
- Prox-penalization and splitting methods for constrained variational problems
- Evolution equations for maximal monotone operators: asymptotic analysis in continuous and discrete time
- Penalty-proximal methods in convex programming
- Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
- Alternating proximal algorithm with costs-to-move, dual description and application to PDE's
Cited In (7)
- Title not available (Why is that?)
- A penalization-gradient algorithm for variational inequalities
- Lagrangian penalization scheme with parallel forward-backward splitting
- A forward–backward penalty scheme with inertial effects for monotone inclusions. Applications to convex bilevel programming
- Title not available (Why is that?)
- Best Approximation from the Kuhn-Tucker Set of Composite Monotone Inclusions
- Title not available (Why is that?)
Uses Software
This page was built for publication: Lagrangian-penalization algorithm for constrained optimization and variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452269)
