A symbolic algorithm for solving linear two-point boundary value problems by modified Picard technique.
H. A. El-ArabawyIsmail K. YoussefPublished in: Math. Comput. Model. (2009)
Keyphrases
- convex quadratic programming
- quadratic optimization problems
- linear systems
- combinatorial optimization
- preprocessing
- benchmark problems
- learning algorithm
- algebraic equations
- matching algorithm
- computational complexity
- gradient projection
- dynamic programming
- linear complexity
- simulated annealing
- objective function
- iterative algorithms
- segmentation algorithm
- expectation maximization
- optimization problems
- np hard
- worst case
- semidefinite programming
- search space
- k means
- cost function
- linear programming problems
- computational cost
- optimization algorithm
- quadratic programming
- detection algorithm
- integer linear programming
- linear programming
- convergence rate