A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
From MaRDI portal
Recommendations
- Alternating proximal algorithm with costs-to-move, dual description and application to PDE's
- Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
- Alternating minimization, proximal minimization and optimization transfer are equivalent
- Alternating proximal algorithm for the problem of bi-level convex minimization
- A class of alternating linearization algorithms for nonsmooth convex optimization
Cited in
(52)- 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
- The Cauchy problem for a nonlinear elliptic equation: Nash-game approach and application to image inpainting
- 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
- Alternating proximal algorithm with costs-to-move, dual description and application to PDE's
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Alternating minimization, proximal minimization and optimization transfer are equivalent
- 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
- scientific article; zbMATH DE number 7363383 (Why is no real title available?)
- 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
- 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
- A new optimization approach to solving split equality problems in Hilbert spaces
- New algorithms for solving the split equality problems in Hilbert spaces
- An operator splitting method for monotone variational inequalities with a new perturbation strategy
- A new mixed split feasibility problem model in Hilbert spaces
- Weak and strong convergence theorems for the mixed split feasibility problem in Hilbert spaces
- A two-step inertial Bregman alternating structure-adapted proximal gradient descent algorithm for nonconvex and nonsmooth problems
- Inertial projection-type algorithms for systems of split equality problems in Hilbert spaces
- Cooperation and competition in multidisciplinary optimization
- Explicit iterative algorithms for solving the split equality problems in Hilbert spaces
- A variational rationality perspective on the quasi-equilibrium problem: climbing the goal ladder
- A parallel algorithm for solving a pair of two variational inequalities in Hilbert spaces
- Two inertial multistep projection-type algorithms for solving mixed split feasibility problems in Hilbert space
- An inexact alternating projection method with application to matrix completion
- The asymptotic behavior of an inertial alternating proximal algorithm for monotone inclusions
This page was built for publication: A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519421)
