Interior Proximal Algorithm for Quasiconvex Programming Problems and Variational Inequalities with Linear Constraints.
Arnaldo S. BritoJoão Xavier da Cruz NetoJurandir O. LopesP. Roberto OliveiraPublished in: J. Optim. Theory Appl. (2012)
Keyphrases
- linearly constrained
- linear constraints
- variational inequalities
- dynamic programming
- k means
- learning algorithm
- computational complexity
- linear programming
- semidefinite programming
- primal dual
- multicriteria optimization
- nonlinear programming
- image denoising
- sensitivity analysis
- convex sets
- objective function
- quasiconvex
- convex hull
- bayesian framework
- np complete
- np hard
- optimal solution
- bayesian networks