Convergence of selections with applications in optimization

DOI10.1016/0022-247X(91)90038-2zbMATH Open0728.90089MaRDI QIDQ805503FDOQ805503

Authors: Robert L. Smith, Irwin E. Schochetman 

Publication date: 1991

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Recommendations

• A selection principle with applications in convex analysis and optimization
• On the convergence of measurable selections and an application to approximations in stochastic optimization
• Convergence and Approximation of Optimization Problems
• Convergence, optimal points and applications
• scientific article; zbMATH DE number 4193471
• Convergence of the solution sets for set optimization problems
• scientific article; zbMATH DE number 2067654
• Convex selections of multifunctions and their applications
• Convergence of Minimal Sets in Convex Vector Optimization
• Convergence of Halpern’s Iteration Method with Applications in Optimization

zbMATH Keywords

systems of inequalitiesdiscrete infinite horizon optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34) Programming in abstract spaces (90C48) Selections in general topology (54C65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An approach to nonlinear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Finite Renewal Algorithm for the Knapsack and Turnpike Models
• Conditions for the Existence of Planning Horizons
• Title not available (Why is that?)
• Title not available (Why is that?)
• Degeneracy in infinite horizon optimization

Cited In (13)

• Title not available (Why is that?)
• Convergence to convex compact sets in infinite dimensions.
• On convergence of minimization methods: Attraction, repulsion, and selection
• Finite dimensional approximation in infinite dimensional mathematical programming
• Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
• Convergence of minimum norm elements of projections and intersections of nested affine spaces in Hilbert space
• Convergence of best approximations from unbounded sets
• A Simplex Method for Countably Infinite Linear Programs
• On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems
• Minimum spanning trees in infinite graphs: theory and algorithms
• Title not available (Why is that?)
• Adherence of minimizers for dual convergences
• On the convergence of measurable selections and an application to approximations in stochastic optimization

This page was built for publication: Convergence of selections with applications in optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805503)