A stochastic approximation method for convex programming with many semidefinite constraints (Q5882223): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114099381, #quickstatements; #temporary_batch_1706814575051
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2022.2091563 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285797048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic semidefinite programming: a new paradigm for stochastic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Truss Topology Design via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak sharp minima revisited. II: Application to linear regularity and error bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent contributions to linear semi-infinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis of Regular Mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient optimality conditions for convex semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds and convergence analysis of feasible descent methods: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of strict Lyapunov functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random algorithms for convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to solve a semi-infinite optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior point method for nonlinear semidefinite programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:32, 31 July 2024

scientific article; zbMATH DE number 7663250
Language Label Description Also known as
English
A stochastic approximation method for convex programming with many semidefinite constraints
scientific article; zbMATH DE number 7663250

    Statements

    A stochastic approximation method for convex programming with many semidefinite constraints (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2023
    0 references
    convex programming
    0 references
    semidefinite programming with many constraints
    0 references
    stochastic approximation
    0 references
    convergence analysis
    0 references
    error bound condition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers