-weighted dual programming of the linear Chebyshev approximation and an interior-point method.
Linyi YangLei-Hong ZhangZhang Ya-NanPublished in: Adv. Comput. Math. (2024)
Keyphrases
- interior point methods
- primal dual
- approximation algorithms
- quadratic programming
- semidefinite
- convex optimization
- linear systems
- linear programming
- linear program
- cutting plane method
- semidefinite programming
- linear programming problems
- convex programming
- closed form
- interior point algorithm
- coefficient matrix
- nonlinear functions
- special case
- convergence rate
- feature selection
- np hard
- inequality constraints
- convex sets
- linear constraints
- computationally intensive
- worst case
- support vector
- optimal solution