Characterizing best approximation from a convex set without convex representation (Q1717625): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jat.2018.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2903642613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fréchet differentiability of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best approximation in inner product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel duality and the strong conical hull intersection property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient KKT optimality conditions in non-convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong conical hull intersection property for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global Approach to Nonlinearly Constrained Best Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Slater's constraint qualification for infinite convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representations of the feasible set in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Extension of Fenchel Duality and its Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4300013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank

Latest revision as of 03:07, 18 July 2024

scientific article
Language Label Description Also known as
English
Characterizing best approximation from a convex set without convex representation
scientific article

    Statements

    Characterizing best approximation from a convex set without convex representation (English)
    0 references
    7 February 2019
    0 references
    The best approximation problem by a finite dimensional section of a convex set is studied in any real Hilbert space, following proper perturbation properties.
    0 references
    0 references
    best approximation
    0 references
    Hilbert space
    0 references
    perturbation property
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references