Pages that link to "Item:Q3519421"

The following pages link to A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move (Q3519421):

Displayed 39 items.

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