Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
From MaRDI portal
(Redirected from Publication:5346622)
Recommendations
- scientific article; zbMATH DE number 205875
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
Cites work
- A bilevel optimization approach for parameter learning in variational models
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A note on segmenting Mann iterates
- A proximal decomposition method for solving convex variational inverse problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- An implementable proximal point algorithmic framework for nuclear norm minimization
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- An overview of bilevel optimization
- Asymptotic Behavior of Inexact Orbits for a Class of Operators in Complete Metric Spaces
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Bilevel Optimization as a Regularization Approach to Pseudomonotone Equilibrium Problems
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Compositions and convex combinations of averaged nonexpansive operators
- Computational Difficulties of Bilevel Linear Programming
- Convergence of hybrid steepest-descent methods for variational inequalities
- Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces
- Convex analysis and nonlinear optimization. Theory and examples
- Convex two-level optimization
- De-noising by soft-thresholding
- Decomposition of images by the anisotropic Rudin-Osher-Fatemi model
- Decomposition through formalization in a product space
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Extension of the Hybrid Steepest Descent Method to a Class of Variational Inequalities and Fixed Point Problems with Nonself-Mappings
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Hard-constrained inconsistent signal feasibility problems
- Hierarchical Convex Optimization With Primal-Dual Splitting
- High-Order Total Variation-Based Image Restoration
- scientific article; zbMATH DE number 3615396 (Why is no real title available?)
- scientific article; zbMATH DE number 1943014 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 5176444 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Ideal spatial adaptation by wavelet shrinkage
- Image recovery via total variation minimization and related problems
- Introductory lectures on convex optimization. A basic course.
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Iterative Methods for Total Variation Denoising
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Mathematical Programs with Optimization Problems in the Constraints
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Monotone Operators and the Proximal Point Algorithm
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- Nonlinear total variation based noise removal algorithms
- Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Mann Iterative Process
- Over-relaxation of the fast iterative shrinkage-thresholding algorithm with variable stepsize
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
- Perturbation resilience and superiorization of iterative algorithms
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Production and marketing decisions with multiple objectives in a competitive environment
- Proximal splitting methods in signal processing
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space
- Robustness of Mann's algorithm for nonexpansive mappings
- Signal Recovery With Certain Involved Convex Data-Fidelity Constraints
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
- Strong convergence theorems by a hybrid steepest descent method for countable nonexpansive mappings in Hilbert spaces
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- The polynomial hierarchy and a simple model for competitive analysis
- Total generalized variation
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
- Weak convergence theorems for nonexpansive mappings in Banach spaces
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
Cited in
(7)- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
- Deep neural network structures solving variational inequalities
- Decentralized hierarchical constrained convex optimization
- Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Lipschitz Certificates for Layered Network Structures Driven by Averaged Activation Operators
- Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
This page was built for publication: Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346622)
