A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
From MaRDI portal
Publication:2139259
Recommendations
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- Convergence of generalized alternating direction method of multipliers for nonseparable nonconvex objective with linear constraints
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 6508162 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A simplified view of first order methods for optimization
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Convex optimization algorithms
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Global convergence of splitting methods for nonconvex composite optimization
- Lagrangian methods for composite optimization
- Lipschitz functions
- Multiplier and gradient methods
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- The landscape of empirical risk for nonconvex losses
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
- Variational analysis and applications
Cited in
(7)- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
- A stochastic moving ball approximation method for smooth convex constrained minimization
This page was built for publication: A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139259)
