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