A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move

From MaRDI portal
Publication:3519421


DOI10.1137/060657248zbMath1149.65039MaRDI QIDQ3519421

Antoine Soubeyran, Hedy Attouch, Patrick Redont

Publication date: 14 August 2008

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060657248


65K05: Numerical mathematical programming methods

90C25: Convex programming

90C29: Multi-objective and goal programming


Related Items

Unnamed Item, Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization, A Strong Convergence Theorem for Solving the Split Equality Fixed Point Problem, A new approach to solving split equality problems in Hilbert spaces, An Inverse-Adjusted Best Response Algorithm for Nash Equilibria, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, An Unrolled Implicit Regularization Network for Joint Image and Sensitivity Estimation in Parallel MR Imaging with Convergence Guarantee, Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems, A cyclic iterative method for solving the system of split equality zero-point problems, Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games, An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems, First-order methods for convex optimization, The Cauchy problem for a nonlinear elliptic equation: Nash-game approach and application to image inpainting, Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators, Forward-partial inverse-forward splitting for solving monotone inclusions, Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes, A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality, Local search proximal algorithms as decision dynamics with costs to move, Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's, An operator splitting method for monotone variational inequalities with a new perturbation strategy, Cooperation and competition in multidisciplinary optimization, The asymptotic behavior of an inertial alternating proximal algorithm for monotone inclusions, A new simultaneous iterative method with a parameter for solving the extended split equality problem and the extended split equality fixed point problem, Maximal elements under reference-dependent preferences with applications to behavioral traps and games, Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization, A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization, An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings, Regularization methods for the split equality problems in Hilbert spaces, A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem, Alternating forward-backward splitting for linearly constrained optimization problems, Games and cost of change, Approximating a common solution of extended split equality equilibrium and fixed point problems, A trust-region method for unconstrained multiobjective problems with applications in satisficing processes, Subgame perfect Nash equilibrium: a learning approach via costs to move, A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, Proximal-type algorithms for split minimization problem in P-uniformly convex metric spaces, Asymptotic behavior of coupled dynamical systems with multiscale aspects, Homogenized eddy current model for non‐destructive testing of metallic cables, Alternating proximal algorithms with asymptotically vanishing coupling. Application to domain decomposition for PDE's