Uniform approximation of min/max functions by smooth splines
From MaRDI portal
Publication:651900
Recommendations
Cites work
- scientific article; zbMATH DE number 3558376 (Why is no real title available?)
- scientific article; zbMATH DE number 1748086 (Why is no real title available?)
- A cutting plane method for solving minimax problems in the complex plane
- A dual algorithm for minimax problems
- A smooth method for the finite minimax problem
- A smoothing trust-region Newton-CG method for minimax problem
- A smoothing-out technique for min—max optimization
- A subgradient algorithm for certain minimax and minisum problems
- Enlarging the region of convergence of Newton's method for constrained optimization
- Modified barrier functions (theory and methods)
- Optimal control computation to account for eccentric movement
- Simultaneous blending of convex polyhedra by algebraic splines
Cited in
(9)- 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
- Uniform approximation by minimum norm interpolation
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
- A smoothing scheme for optimization problems with max-min constraints
- Construction of approximation functionals for minimal splines
- A spline smoothing Newton method for semi-infinite minimax problems
- A spline smoothing homotopy method for nonconvex nonlinear programming
- A spline smoothing Newton method for finite minimax problems
This page was built for publication: Uniform approximation of min/max functions by smooth splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651900)