Uniform approximation of min/max functions by smooth splines

DOI10.1016/j.cam.2011.06.023zbMath1229.90263OpenAlexW2051005201MaRDI QIDQ651900

Zhirui Wang, Guohui Zhao, Haining Mou

Publication date: 19 December 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2011.06.023

zbMATH Keywords

minimaxsplineuniform approximationMorgan-Scott partition

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47)

Related Items (5)

A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ A spline smoothing Newton method for finite minimax problems ⋮ A spline smoothing homotopy method for nonconvex nonlinear programming ⋮ A spline smoothing Newton method for semi-infinite minimax problems

Cites Work

• Unnamed Item
• Unnamed Item
• Simultaneous blending of convex polyhedra by algebraic splines
• A smooth method for the finite minimax problem
• A smoothing trust-region Newton-CG method for minimax problem
• Enlarging the region of convergence of Newton's method for constrained optimization
• Modified barrier functions (theory and methods)
• A cutting plane method for solving minimax problems in the complex plane
• A dual algorithm for minimax problems
• A smoothing-out technique for min—max optimization
• A subgradient algorithm for certain minimax and minisum problems
• Optimal control computation to account for eccentric movement

This page was built for publication: Uniform approximation of min/max functions by smooth splines