A convergent ADMM algorithm for grain boundary energy minimization
From MaRDI portal
Cites work
- A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization
- A three-dimensional continuum simulation method for grain boundary motion incorporating dislocation structure
- Alternating and parallel proximal gradient methods for nonsmooth, nonconvex minimax: a unified convergence analysis
- An alternating direction method with increasing penalty for stable principal component pursuit
- Continuum approximation of the Peach-Koehler force on dislocations in a slip plane
- Continuum framework for dislocation structure, energy and dynamics of dislocation arrays and low angle grain boundaries
- Continuum model and numerical method for dislocation structure and energy of grain boundaries
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Convergence of three-block ADMM for weakly convex optimization problems
- Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons
- Dislocation Models of Crystal Grain Boundaries
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
- Motion of grain boundaries with dynamic lattice misorientations and with triple junctions drag
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- On second order conditions for quasiconvexity
- On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
This page was built for publication: A convergent ADMM algorithm for grain boundary energy minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305860)
