Approximation methods for non-convex curves

MaRDI QIDQ1847152zbMATH OpenFDO

Authors Yanqun Liu, Kok Lay Teo, Xiao Qi Yang

Publication date 17 November 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

approximation methodquadratic convergenceconvexificationbi-criteria optimizationnon-convex curve

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Algorithms for approximation of functions (65D15)

Recommendations

• A method for convex curve approximation
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Nonconvex approximations in unconstrained minimization
• The convergence rate of the sandwich algorithm for approximating convex functions
• Sandwich approximation of univariate convex functions with an application to separable convex programming

Cites work

• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• scientific article; zbMATH DE number 42283 (Why is no real title available?)
• scientific article; zbMATH DE number 503304 (Why is no real title available?)
• A method for convex curve approximation
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Convexification of a noninferior frontier
• Multiobjective programming and planning
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• The convergence rate of the sandwich algorithm for approximating convex functions

Cited in

(3)

• High order approximation method for curves
• A methodology for assessing eco-efficiency in logistics networks
• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets

This page was built for publication: Approximation methods for non-convex curves

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