Penalization in non-classical convex programming via variational convergence

DOI10.1007/BF01586942zbMath0748.90051MaRDI QIDQ1181900

B. Lemaire, Pierre Alart

Publication date: 27 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

penalty methodvariational convergenceperturbed proximal regularization

Mathematics Subject Classification ID

Related Items (22)

Penalty Method for Non-Stationary General Variational Like Inequalities ⋮ Convergence of diagonally stationary sequences in convex optimization ⋮ Iterative processes for solving incorrect convex variational problems ⋮ Proximal interior point approach in convex programming (ill-posed problems)^*† ⋮ Proximal point method and elliptic regularization ⋮ Coupling proximal methods and variational convergence ⋮ Multi-step-prox-regularization method for solving convex variation problems ⋮ Coupling the proximal point algorithm with approximation methods ⋮ Iterative Method for Non-Stationary Mixed Variational Inequalities ⋮ Theoretical aspect of diagonal Bregman proximal methods ⋮ Selective bi-coordinate method for limit non-smooth resource allocation type problems ⋮ Two-level iterative method for non-stationary mixed variational inequalities ⋮ Iterative regularization via dual diagonal descent ⋮ Application of the penalty method to nonstationary approximation of an optimization problem ⋮ VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks ⋮ Application of penalty methods to non-stationary variational inequalities ⋮ Application of the penalty method to limit quasi-equilibrium problems ⋮ The perturbed Tikhonov's algorithm and some of its applications ⋮ Proximal methods in view of interior-point strategies ⋮ Prox-regularization and solution of ill-posed elliptic variational inequalities ⋮ An inexact penalty method for non stationary generalized variational inequalities ⋮ The perturbed proximal point algorithm and some of its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two general methods for computing saddle points with applications for decomposing convex programming problems
• Penalty-proximal methods in convex programming
• Sur certains espaces vectoriels topologiques
• Isometries for the Legendre-Fenchel Transform
• Monotone Operators and the Proximal Point Algorithm
• Convex Analysis

This page was built for publication: Penalization in non-classical convex programming via variational convergence