Duality and Convex Programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- L₂ Spectral Estimation
- A Dual Approach to Linear Inverse Problems with Convex Constraints
- A Dual Approach to Multidimensional L_p Spectral Estimation Problems
- A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
- A dual algorithm for denoising and preserving edges in image processing
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A new proof for maximal monotonicity of subdifferential operators
- A regularized dual-based iterative method for a class of image reconstruction problems
- A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Alternating Projections on Manifolds
- An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration
- Atomic Decomposition by Basis Pursuit
- Best approximation in inner product spaces
- CVXGEN: a code generator for embedded convex optimization
- Characterization of the subdifferentials of convex functions
- Convergence of Best Entropy Estimates
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex parametric piecewise quadratic optimization: theory and algorithms
- Decoding by Linear Programming
- Duality for nonconvex approximation and optimization.
- Efficient schemes for total variation minimization under constraints in image processing
- Fast Moreau envelope computation I: Numerical algorithms
- Faster than the fast Legendre transform, the linear-time Legendre transform
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- From Hahn--Banach to monotonicity
- Global convergence of a non-convex Douglas-Rachford iteration
- Hard thresholding pursuit: an algorithm for compressive sensing
- Ideal spatial adaptation by wavelet shrinkage
- Image recovery via total variation minimization and related problems
- Integrals which are convex functionals. II
- Iterative hard thresholding for compressed sensing
- Just relax: convex programming methods for identifying sparse signals in noise
- Linear and nonlinear programming.
- Local linear convergence for alternating and averaged nonconvex projections
- Mathematical problems in image processing. Partial differential equations and the calculus of variations. Foreword by Olivier Faugeras
- Maximum Entropy Reconstruction Using Derivative Information, Part 1: Fisher Information and Convex Duality
- Maximum Entropy Regularization for Fredholm Integral Equations of the First Kind
- Maximum d'entropie et problème des moments. (Maximum entropy and the moment problem)
- Maximum entropy reconstruction using derivative information. II: Computational results
- Method of successive projections for finding a common point of sets in metric spaces
- Monotone (nonlinear) operators in Hilbert space
- Nonlinear total variation based noise removal algorithms
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On Conjugate Convex Functions
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems
- On the maximal monotonicity of subdifferential mappings
- Optical Wavefront Reconstruction: Theory and Numerical Methods
- Proximité et dualité dans un espace hilbertien
- Relaxed averaged alternating reflections for diffraction imaging
- Restricted normal cones and sparsity optimization with affine constraints
- Restricted normal cones and the method of alternating projections: theory
- Signal Recovery by Proximal Forward-Backward Splitting
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Symbolic Fenchel conjugation
- Techniques of variational analysis
- The piecewise linear-quadratic model for computational convex analysis
- Variational Analysis
- Variational Analysis Applied to the Problem of Optical Phase Retrieval
- Variational methods in imaging
- Variational methods in the presence of symmetry
- What shape is your conjugate? A survey of computational convex analysis and its applications
Cited in
(9)- A one-step Tikhonov regularization iterative scheme for solving split feasibility and fixed point problems
- scientific article; zbMATH DE number 1139561 (Why is no real title available?)
- scientific article; zbMATH DE number 3238297 (Why is no real title available?)
- On duality for square root convex programs
- Halpern-type iterative process for solving split common fixed point and monotone variational inclusion problem between Banach spaces
- Concave programming and DH-point
- scientific article; zbMATH DE number 2006093 (Why is no real title available?)
- Dualizing optimization problems in mathematical economics
- An introduction to continuous optimization for imaging
This page was built for publication: Duality and Convex Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789804)
