Feasibility problems via paramonotone operators in a convex setting
From MaRDI portal
Publication:6618206
DOI10.1080/02331934.2024.2313690MaRDI QIDQ6618206
Maria J. Cánovas, Juan-Enrique Martinez-Legaz, Juan Parra, James jun. Camacho
Publication date: 14 October 2024
Published in: Optimization (Search for Journal in Brave)
Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Monotone operators and generalizations (47H05) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Convex functions, monotone operators and differentiability.
- Convexity and well-posed problems
- Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Monotone operators representable by l.s.c. convex functions
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric
- Regularity modulus of arbitrarily perturbed linear inequality systems
- From Hahn--Banach to monotonicity
- Extension of Fenchel's duality theorem for convex functions
- Characterization of solution sets of convex programs
- On Borwein–Wiersma Decompositions of Monotone Linear Relations
- Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
- An iterative solution of a variational inequality for certain monotone operators in Hilbert space
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Convex Analysis and Beyond
- Rectangularity and paramonotonicity of maximally monotone operators
- Conditioning of Convex Programs from a Primal-Dual Perspective
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Feasibility problems via paramonotone operators in a convex setting