Modified Lagrangian methods for separable optimization problems

DOI10.1155/2012/471854zbMATH Open1243.49038OpenAlexW2063394266WikidataQ58695271 ScholiaQ58695271MaRDI QIDQ437562FDOQ437562

Authors: Abdelouahed Hamdi, A. A. Mukheimer 

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

Recommendations

• scientific article; zbMATH DE number 4009672
• An augmented Lagrangian method for distributed optimization
• Interior-point Lagrangian decomposition method for separable convex optimization
• Decomposition methods based on augmented Lagrangians: a survey
• On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization

zbMATH Keywords

convergence analysisdecomposition methodmodified Lagrangiansprimal-dual sequencesstructured optimization problems

Mathematics Subject Classification ID

Decomposition methods (49M27)

Cites Work

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

Cited In (7)

• Sequential threshold control in descent splitting methods for decomposable optimization problems
• An augmented-Lagrangian-based parallel splitting method for solving network resource allocation problems
• Title not available (Why is that?)
• On alternating direction method for solving variational inequality problems with separable structure
• Title not available (Why is that?)
• Adaptive descent splitting method for decomposable optimization problems
• Simulated annealing-based krill herd algorithm for global optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q437562)