Lagrangian-penalization algorithm for constrained optimization and variational inequalities
From MaRDI portal
(Redirected from Publication:452269)
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
Cites work
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating proximal algorithm with costs-to-move, dual description and application to PDE's
- Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
- Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
- Atomic Decomposition by Basis Pursuit
- Augmented Lagrangian and proximal alternating direction methods of multipliers in Hilbert spaces. Applications to games, PDE's and control
- Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
- 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
- Evolution equations for maximal monotone operators: asymptotic analysis in continuous and discrete time
- Exact Regularization of Convex Programs
- Monotone Operators and the Proximal Point Algorithm
- Penalty-proximal methods in convex programming
- Produits infinis de resolvantes
- Prox-penalization and splitting methods for constrained variational problems
- Stable signal recovery from incomplete and inaccurate measurements
- Variational Analysis in Sobolev andBVSpaces
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(7)- Best approximation from the Kuhn-Tucker set of composite monotone inclusions
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- A forward–backward penalty scheme with inertial effects for monotone inclusions. Applications to convex bilevel programming
- A penalization-gradient algorithm for variational inequalities
- scientific article; zbMATH DE number 5670172 (Why is no real title available?)
- scientific article; zbMATH DE number 6270284 (Why is no real title available?)
- Lagrangian penalization scheme with parallel forward-backward splitting
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)
