Approximation methods for non-convex curves

zbMATH Open1009.90134MaRDI QIDQ1847152FDOQ1847152

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)

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

zbMATH Keywords

approximation methodquadratic convergenceconvexificationbi-criteria optimizationnon-convex curve

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Multiobjective programming and planning
• Convexification of a noninferior frontier
• The convergence rate of the sandwich algorithm for approximating convex functions
• A method for convex curve approximation
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Title not available (Why is that?)
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• Title not available (Why is that?)

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)