Home ›
Entities
› academia
› Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications
Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications
Research article (Journal of Computational and Applied Mathematics, 2018) · cited 14× · AI/ML
Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications
Summary
Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications is a scholarly article[1].
Key Facts
Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications. Retrieved May 24, 2026, from https://4ort.xyz/entity/infeasible-interior-point-algorithms-based-on-sampling-average-approximations-for-a-class-of-stochastic-complementarity-
MLA“Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/infeasible-interior-point-algorithms-based-on-sampling-average-approximations-for-a-class-of-stochastic-complementarity-.
BibTeX@misc{4ortxyz_infeasible-interior-point-algorithms-based-on-sampling-average-approximations-for-a-class-of-stochastic-complementarity-_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications}}, year = {2026}, url = {https://4ort.xyz/entity/infeasible-interior-point-algorithms-based-on-sampling-average-approximations-for-a-class-of-stochastic-complementarity-}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications — https://4ort.xyz/entity/infeasible-interior-point-algorithms-based-on-sampling-average-approximations-for-a-class-of-stochastic-complementarity- (retrieved 2026-05-24)
