How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Extrapolation algorithm for affine-convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbertian convex feasibility problem: Convergence of projection methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual multilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse proximal implementation of the LP dual active set algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are projection methods for convex feasibility problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEr and SifDec / rank
 
Normal rank
Property / cites work
 
Property / cites work: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition through formalization in a product space / rank
 
Normal rank

Latest revision as of 08:34, 5 July 2024

scientific article
Language Label Description Also known as
English
How good are extrapolated bi-projection methods for linear feasibility problems?
scientific article

    Statements

    Identifiers