Modified Lagrangian methods for separable optimization problems

DOI10.1155/2012/471854zbMath1243.49038OpenAlexW2063394266WikidataQ58695271 ScholiaQ58695271MaRDI QIDQ437562

Aiman A. Mukheimer, Abdelouahed Hamdi

Publication date: 18 July 2012

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/471854

zbMATH Keywords

convergence analysisdecomposition methodmodified Lagrangiansprimal-dual sequencesstructured optimization problems

Mathematics Subject Classification ID

Decomposition methods (49M27)

Related Items

On alternating direction method for solving variational inequality problems with separable structure ⋮ Simulated annealing-based krill herd algorithm for global optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming
• Primal-dual nonlinear rescaling method for convex optimization
• Nonlinear rescaling as interior quadratic prox method in convex optimization
• Extended general variational inequalities
• A diagonal quadratic approximation method for large scale linear programs
• Application of the alternating direction method of multipliers to separable convex programming problems
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A logarithmic-quadratic proximal method for variational inequalities
• Parallel alternating direction multiplier decomposition of convex programs
• A proximal-based deomposition method for compositions method for convex minimization problems
• Nonlinear rescaling and proximal-like methods in convex optimization
• Nonlinear proximal decomposition method for convex programming
• Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• Some developments in general variational inequalities
• Separable diagonalized multiplier method for decomposition nonlinear programs
• Decomposition for structured convex programs with smooth multiplier methods
• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
• Applications of the method of partial inverses to convex programming: Decomposition
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
• Penalty/Barrier Multiplier Methods for Convex Programming Problems
• Convergence of Proximal-Like Algorithms
• Proximal Minimization Methods with Generalized Bregman Functions
• A new proximal decomposition algorithm for routing in telecommunication networks
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Proximal Decomposition on the Graph of a Maximal Monotone Operator
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• An inexact method of partial inverses and a parallel bundle method
• Convex Analysis
• Log-sigmoid multipliers method in constrained optimization
• Entropic proximal decomposition methods for convex programs and variational inequalities

This page was built for publication: Modified Lagrangian methods for separable optimization problems