Modified Lagrangians in convex programming and their generalizations

DOI10.1007/BFb0120845zbMath0404.90069OpenAlexW2257208204MaRDI QIDQ4190443

E. G. Gol'Shtejn, N. V. Tret'Yakov

Publication date: 1979

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120845

zbMATH Keywords

Convex ProgrammingDuality TheoryComputational StudyModified LagrangiansMomotone OperatorSmooth Dual ProblemsStability of Saddle Points

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (37)

A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming ⋮ New inertial factors of the Krasnosel'skiĭ-Mann iteration ⋮ An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems ⋮ A customized proximal point algorithm for convex minimization with linear constraints ⋮ Another weak convergence theorems for accretive mappings in Banach spaces ⋮ Weak convergence of an iterative sequence for accretive operators in Banach spaces ⋮ An iterative method based on ADMM for solving generalized Sylvester matrix equations ⋮ Inexact alternating direction methods of multipliers for separable convex optimization ⋮ On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective ⋮ A variable projection method for large-scale inverse problems with \(\ell^1\) regularization ⋮ Extended extragradient methods for generalized variational inequalities ⋮ A two-stage numerical approach for the sparse initial source identification of a diffusion–advection equation ^* ⋮ An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems ⋮ Weak and strong convergence of generalized proximal point algorithms with relaxed parameters ⋮ A proximal point algorithm revisit on the alternating direction method of multipliers ⋮ Strong convergence of an iterative algorithm for variational inequalities in Banach spaces ⋮ On convergence criteria of generalized proximal point algorithms ⋮ On Glowinski's open question on the alternating direction method of multipliers ⋮ Accelerated proximal point method for maximally monotone operators ⋮ Weak convergence of a projection algorithm for variational inequalities in a Banach space ⋮ On the optimal linear convergence rate of a generalized proximal point algorithm ⋮ Convex relaxation of a class of vertex penalizing functionals ⋮ A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming ⋮ Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ Unnamed Item ⋮ Convergence rates for an inexact ADMM applied to separable convex optimization ⋮ The generalized proximal point algorithm with step size 2 is not necessarily convergent ⋮ Lagrangian penalization scheme with parallel forward-backward splitting ⋮ The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent ⋮ Generalized alternating direction method of multipliers: new theoretical insights and applications ⋮ A parameterized proximal point algorithm for separable convex optimization ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming ⋮ Convergence analysis of the relaxed proximal point algorithm ⋮ Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming

This page was built for publication: Modified Lagrangians in convex programming and their generalizations