Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
From MaRDI portal
Publication:5346622
DOI10.1088/1361-6420/33/4/044003zbMath1453.65138OpenAlexW2594914074MaRDI QIDQ5346622
Publication date: 26 May 2017
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1361-6420/33/4/044003
superiorizationaugmented Lagrangian methodshybrid steepest descent methodhierarchical convex optimization
Numerical mathematical programming methods (65K05) Convex programming (90C25) Hierarchical games (including Stackelberg games) (91A65)
Related Items
On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions ⋮ Deep neural network structures solving variational inequalities ⋮ Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks ⋮ Decentralized hierarchical constrained convex optimization ⋮ Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Lipschitz Certificates for Layered Network Structures Driven by Averaged Activation Operators
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Compositions and convex combinations of averaged nonexpansive operators
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Convergence of hybrid steepest-descent methods for variational inequalities
- Robustness of Mann's algorithm for nonexpansive mappings
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
- Convex two-level optimization
- Weak convergence theorems for nonexpansive mappings in Banach spaces
- Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Production and marketing decisions with multiple objectives in a competitive environment
- Image recovery via total variation minimization and related problems
- Introductory lectures on convex optimization. A basic course.
- Convex analysis and nonlinear optimization. Theory and examples
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- An overview of bilevel optimization
- A note on segmenting Mann iterates
- Hard-constrained inconsistent signal feasibility problems
- A Bilevel Optimization Approach for Parameter Learning in Variational Models
- Proximal Splitting Methods in Signal Processing
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Singular Value Thresholding Algorithm for Matrix Completion
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Over-relaxation of the fast iterative shrinkage-thresholding algorithm with variable stepsize
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Computational Difficulties of Bilevel Linear Programming
- Extension of the Hybrid Steepest Descent Method to a Class of Variational Inequalities and Fixed Point Problems with Nonself-Mappings
- A proximal decomposition method for solving convex variational inverse problems
- Perturbation resilience and superiorization of iterative algorithms
- Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Decomposition through formalization in a product space
- The polynomial hierarchy and a simple model for competitive analysis
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Ideal spatial adaptation by wavelet shrinkage
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space
- Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- High-Order Total Variation-Based Image Restoration
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- Hierarchical Convex Optimization With Primal-Dual Splitting
- Signal Recovery With Certain Involved Convex Data-Fidelity Constraints
- Decomposition of images by the anisotropic Rudin-Osher-Fatemi model
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- De-noising by soft-thresholding
- Iterative Methods for Total Variation Denoising
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Bilevel Optimization as a Regularization Approach to Pseudomonotone Equilibrium Problems
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Asymptotic Behavior of Inexact Orbits for a Class of Operators in Complete Metric Spaces
- On the Mann Iterative Process
- Mathematical Programs with Optimization Problems in the Constraints
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Total Generalized Variation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
