Coupling the gradient method with a general exterior penalization scheme for convex minimization

DOI10.1007/S10957-011-9936-XzbMATH Open1247.90214OpenAlexW2001702564MaRDI QIDQ415412FDOQ415412

Authors: Juan Peypouquet 

Publication date: 8 May 2012

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/128195

Recommendations

• Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
• Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
• An inertial proximal-gradient penalization scheme for constrained convex optimization problems
• scientific article; zbMATH DE number 4045488
• Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data

zbMATH Keywords

Convex optimizationgradient methodexterior penalization schemehierarchical minimizationnon-autonomous gradient-like systemsrobustness and stability results

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) Methods of reduced gradient type (90C52)

Cites Work

• Stable signal recovery from incomplete and inaccurate measurements
• Convex Analysis
• A proximal-based deomposition method for compositions method for convex minimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• Quasi-Fejérian analysis of some optimization algorithms
• Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
• Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
• Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
• Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
• Asymptotic behavior of coupled dynamical systems with multiscale aspects
• Prox-penalization and splitting methods for constrained variational problems
• Penalty-proximal methods in convex programming
• Primal and dual convergence of a proximal point exponential penalty method for linear programming
• Proximal alternating directions method for structured variational inequalities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
• Asymptotic almost-equivalence of Lipschitz evolution systems in Banach spaces

Cited In (21)

• Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
• An inertial proximal-gradient penalization scheme for constrained convex optimization problems
• Approaching the solving of constrained variational inequalities via penalty term-based dynamical systems
• Second-order dynamical systems with penalty terms associated to monotone inclusions
• Weak and strong convergences of the generalized penalty Forward–Forward and Forward–Backward splitting algorithms for solving bilevel hierarchical pseudomonotone equilibrium problems
• Levenberg-Marquardt dynamics associated to variational inequalities
• Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
• Splitting proximal with penalization schemes for additive convex hierarchical minimization problems
• A forward–backward penalty scheme with inertial effects for monotone inclusions. Applications to convex bilevel programming
• Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems
• A Tseng's type penalty scheme for solving inclusion problems involving linearly composed and parallel-sum type monotone operators
• Forward-backward and Tseng's type penalty schemes for monotone inclusion problems
• The forward-backward splitting methods for variational inequalities and minimization problems in Banach spaces
• Backward penalty schemes for monotone inclusion problems
• Generalized forward-backward splitting with penalization for monotone inclusion problems
• Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
• Iterative regularization via dual diagonal descent
• Forward-backward penalty scheme for constrained convex minimization without inf-compactness
• A second-order dynamical system with Hessian-driven damping and penalty term associated to variational inequalities
• Second-order dynamical systems associated to variational inequalities
• Penalty schemes with inertial effects for monotone inclusion problems

This page was built for publication: Coupling the gradient method with a general exterior penalization scheme for convex minimization

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