Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4779122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing projected Newton-type algorithm for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order methods of smooth convex optimization with inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization. Algorithms and consistent approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving large-scale finite minimax problems using exponential smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-infinite programming, duality, discretization and optimality conditions† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization in semi-infinite programming: the rate of convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Extension of Newton’s Method to Semi-Infinite Minimax Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation optimization using the cross-entropy method with optimal computing budget allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Budget Allocation for Sample Average Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive constraint reduction for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing method for minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with adaptive smoothing for finite minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing trust-region Newton-CG method for minimax problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464640 / rank
 
Normal rank

Latest revision as of 05:21, 6 July 2024

scientific article
Language Label Description Also known as
English
Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
scientific article

    Statements

    Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (English)
    0 references
    0 references
    0 references
    14 February 2013
    0 references
    semiinfinite minimax problems
    0 references
    robust optimization
    0 references
    discretization algorithms
    0 references
    rate of convergence
    0 references
    exponential smoothing technique
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers