A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Alvaro Rodolfo de Pierro / rank
Normal rank
 
Property / author
 
Property / author: Alvaro Rodolfo de Pierro / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Regularization tools / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UTV / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1908006783 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.05631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal point method for nonsmooth convex optimization problems in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of inexact two-point Newton-like methods on Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with Sparsity-Inducing Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variable Metric Proximal Point Algorithm for Monotone Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation resilience and superiorization of iterative algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected subgradient minimization versus superiorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving monotone inclusions via compositions of nonexpansive averaged operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupling the proximal point algorithm with approximation methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility-Seeking and Superiorization Algorithms Applied to Inverse Treatment Planning in Radiation Therapy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finitely convergent ``row-action'' method for the convex feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order methods of smooth convex optimization with inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate iterations in Bregman-function-based proximal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast alternating linearization methods for minimizing the sum of two convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accelerated inexact proximal point algorithm for convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Image reconstruction from a small number of projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Variants of the Proximal Point Algorithm without Monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded perturbation resilience of projected scaled gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact accelerated augmented Lagrangian methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inexact generalized proximal methods with a weakened error tolerance criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point and Bregman iterative methods for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Inexact Variable Metric Proximal Point Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Infinite Products of Nonexpansive Mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3654221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Strong Convergence Theorems Regarding Iterative Methods for Solving Equilibrium Problems in Reflexive Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of inexact infinite products of nonexpansive mappings in metric spaces / 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: Q4903682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact and nonmonotone proximal method for smooth unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated and Inexact Forward-Backward Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a proximal-like algorithm in the presence of computational errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal monotone operators and the proximal point algorithm in the presence of computational errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradient projection algorithms and approximate solutions of convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradient projection algorithms for convex feasibility problems in the presence of computational errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of a turnpike phenomenon for approximate solutions of nonautonomous discrete-time optimal control systems / rank
 
Normal rank

Latest revision as of 20:56, 13 July 2024

scientific article; zbMATH DE number 6723362
Language Label Description Also known as
English
A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
scientific article; zbMATH DE number 6723362

    Statements

    A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (English)
    0 references
    0 references
    26 May 2017
    0 references
    FISTA
    0 references
    decay rate
    0 references
    error terms
    0 references
    inexactness
    0 references
    minimization problem
    0 references
    superiorization
    0 references
    accelerated proximal forward-backward algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers