Amanote Research

Amanote Research

    RegisterSign In

Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets

SSRN Electronic Journal
doi 10.2139/ssrn.1427721
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2009

Authors
Gijs RennenEdwin van DamDick den Hertog
Publisher

Elsevier BV


Related search

On Asymptotic Algorithms for Approximating Arbitrary Polygons by Simpler Convex Polygons.

English

Approximating Residual Sets by Strongly Residual Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1970English

Efficient Algorithms for Approximating Polygonal Chains

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2000English

Separating Convex Sets.

English

Lattices of Convex Sets

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1977English

Three Convex Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1983English

Approximating Minimal Communicated Event Sets for Decentralized Supervisory Control

IFAC Proceedings Volumes
2005English

Large Deviations Analysis of Reflected Diffusions and Constrained Stochastic Approximation Algorithms in Convex Sets†

Stochastics
1987English

On Supportless Convex Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1985English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy