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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-015-0268-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060208662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic properties of the Fenchel dual functional and applications to decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth Morse--Sard theorem for subanalytic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clarke Subgradients of Stratifiable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of the alternating direction method of multipliers to separable convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal parallel splitting method for minimizing sum of convex functions with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ADM-based splitting method for separable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new inexact alternating directions method for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5440593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semi- and subanalytic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Proximal-Like Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of subgradient method for variational inequality problems in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified extragradient method for variational inequalities and verification of solution existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient simultaneous method for the constrained multiple-sets split feasibility problem / rank
 
Normal rank

Revision as of 18:52, 10 July 2024

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

    Statements

    A new alternating direction method for linearly constrained nonconvex optimization problems (English)
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    nonconvex constrained problem
    0 references
    convergence theorem
    0 references
    Kurdyka-Lojasiewicz property
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers