Duality and Convex Programming
From MaRDI portal
Publication:2789804
DOI10.1007/978-1-4939-0790-8_7zbMath1331.49041OpenAlexW4211263333MaRDI QIDQ2789804
D. Russell Luke, Jonathan M. Borwein
Publication date: 2 March 2016
Published in: Handbook of Mathematical Methods in Imaging (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4939-0790-8_7
Convex programming (90C25) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Numerical methods of relaxation type (49M20)
Related Items
Halpern-type iterative process for solving split common fixed point and monotone variational inclusion problem between Banach spaces ⋮ An introduction to continuous optimization for imaging
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Restricted normal cones and the method of alternating projections: theory
- CVXGEN: a code generator for embedded convex optimization
- Restricted normal cones and sparsity optimization with affine constraints
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Convex parametric piecewise quadratic optimization: theory and algorithms
- Iterative hard thresholding for compressed sensing
- Local linear convergence for alternating and averaged nonconvex projections
- The piecewise linear-quadratic model for computational convex analysis
- Fast Moreau envelope computation I: Numerical algorithms
- Method of successive projections for finding a common point of sets in metric spaces
- Linear and nonlinear programming.
- Variational methods in imaging
- Symbolic Fenchel conjugation
- A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Monotone (nonlinear) operators in Hilbert space
- Maximum d'entropie et problème des moments. (Maximum entropy and the moment problem)
- On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems
- Maximum entropy reconstruction using derivative information. II: Computational results
- Image recovery via total variation minimization and related problems
- Faster than the fast Legendre transform, the linear-time Legendre transform
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Global convergence of a non-convex Douglas-Rachford iteration
- From Hahn--Banach to monotonicity
- Techniques of variational analysis
- Duality for nonconvex approximation and optimization.
- Characterization of the subdifferentials of convex functions
- On the maximal monotonicity of subdifferential mappings
- Integrals which are convex functionals. II
- Variational methods in the presence of symmetry
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- A Dual Approach to Linear Inverse Problems with Convex Constraints
- Decoding by Linear Programming
- Just relax: convex programming methods for identifying sparse signals in noise
- Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- $L_2 $ Spectral Estimation
- A Dual Approach to Multidimensional $L_p$ Spectral Estimation Problems
- Convergence of Best Entropy Estimates
- Atomic Decomposition by Basis Pursuit
- A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
- Maximum Entropy Regularization for Fredholm Integral Equations of the First Kind
- A regularized dual-based iterative method for a class of image reconstruction problems
- Ideal spatial adaptation by wavelet shrinkage
- Variational Analysis
- Variational Analysis Applied to the Problem of Optical Phase Retrieval
- Optical Wavefront Reconstruction: Theory and Numerical Methods
- Relaxed averaged alternating reflections for diffraction imaging
- On Projection Algorithms for Solving Convex Feasibility Problems
- Maximum Entropy Reconstruction Using Derivative Information, Part 1: Fisher Information and Convex Duality
- What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
- Alternating Projections on Manifolds
- A dual algorithm for denoising and preserving edges in image processing
- An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration
- Signal Recovery by Proximal Forward-Backward Splitting
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- On Conjugate Convex Functions
- Convex analysis and monotone operator theory in Hilbert spaces
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Best approximation in inner product spaces
- Mathematical problems in image processing. Partial differential equations and the calculus of variations. Foreword by Olivier Faugeras
This page was built for publication: Duality and Convex Programming
