A modified local quadratic approximation algorithm for penalized optimization problems.
Sangin LeeSunghoon KwonYongdai KimPublished in: Comput. Stat. Data Anal. (2016)
Keyphrases
- objective function
- cost function
- optimal solution
- computational complexity
- improved algorithm
- optimization problems
- preprocessing
- error bounds
- detection algorithm
- high accuracy
- learning algorithm
- times faster
- np hard
- dynamic programming
- spline interpolation
- theoretical analysis
- significant improvement
- pairwise
- evolutionary algorithm
- data sets
- computationally efficient
- experimental evaluation
- segmentation algorithm
- optimization algorithm
- clustering method
- k means
- convergence rate
- optimization method
- error tolerance
- approximation ratio
- polygonal approximation
- optimization methods
- convex hull
- combinatorial optimization
- worst case
- closed form
- matching algorithm
- linear programming
- computational cost
- least squares