A new alternating direction method for linearly constrained nonconvex optimization problems (Q496618): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 02:49, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	A new alternating direction method for linearly constrained nonconvex optimization problems	scientific article

Statements

scholarly article

0 references

A new alternating direction method for linearly constrained nonconvex optimization problems (English)

0 references

0 references

0 references

Journal of Global Optimization

0 references

publication date

22 September 2015

0 references

zbMATH Keywords

nonconvex constrained problem

0 references

convergence theorem

0 references

Kurdyka-Lojasiewicz property

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1007/s10898-015-0268-5

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Asymptotic properties of the Fenchel dual functional and applications to decomposition problems

0 references

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

A nonsmooth Morse--Sard theorem for subanalytic functions

0 references

Clarke Subgradients of Stratifiable Functions

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Application of the alternating direction method of multipliers to separable convex programming problems

0 references

A dual algorithm for the solution of nonlinear variational problems via finite element approximation

0 references

0 references

A proximal parallel splitting method for minimizing sum of convex functions with linear constraints

0 references

A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems

0 references

An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing

0 references

An ADM-based splitting method for separable convex programming

0 references

0 references

A new inexact alternating directions method for monotone variational inequalities

0 references

0 references

Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities

0 references

Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities

0 references

0 references

On semi- and subanalytic geometry

0 references

0 references

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Convergence of Proximal-Like Algorithms

0 references

Convergence of a block coordinate descent method for nondifferentiable minimization

0 references

An extension of subgradient method for variational inequality problems in Hilbert space

0 references

Modified extragradient method for variational inequalities and verification of solution existence

0 references

An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints

0 references

An efficient simultaneous method for the constrained multiple-sets split feasibility problem

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10898-015-0268-5

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:496618

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q496618&oldid=38131318"