A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative study of RPSALG algorithm for convex semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of increasing positively homogeneous functions over the unit simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Chubanov's Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry and combinatorics of the cutting angle method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting angle method – a tool for constrained global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5453761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded lower subdifferentiability optimization techniques: applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclic Douglas-Rachford iteration scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions to multi-objective linear programs with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4357206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post-Optimal Analysis in Linear Semi-Infinite Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate of convergence of a class of numerical methods solving linear inequality systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2844654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation methods for solving linear inequality systems: converging results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation method for solving systems with infinitely many linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4191529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract convexity and global optimization / rank
 
Normal rank

Latest revision as of 21:32, 14 July 2024

scientific article
Language Label Description Also known as
English
A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
scientific article

    Statements

    A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (English)
    0 references
    15 December 2017
    0 references
    linear semi-infinite systems
    0 references
    feasibility problem
    0 references
    relaxation method
    0 references
    cutting angle method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers