Knapsack feasibility as an absolute value equation solvable by successive linear programming

Optimization Letters

Volumn 3, Issue 2, 2009, Pages 161-170

  Mangasarian, O L ^a,b  

^a University of Wisconsin   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Absolute value equations; Knapsack feasibility; Successive linear programming

Indexed keywords

ABSOLUTE VALUE EQUATIONS; CONCAVE QUADRATIC FUNCTIONS; EXACT SOLUTIONS; FEASIBILITY PROBLEMS; KNAPSACK FEASIBILITY; LINEAR PROGRAMS; NON-INTEGER COMPONENTS; NP-HARD; POLYHEDRAL SETS; REAL VARIABLES; RELATIVE ERRORS; SUCCESSIVE LINEAR PROGRAMMING; SUFFICIENT CONDITIONS;

DYNAMIC PROGRAMMING; LINEARIZATION; OPTIMIZATION; PARTICLE SIZE ANALYSIS;

LINEAR PROGRAMMING;

EID: 64949086423     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-008-0102-9     Document Type: Article

References (12)

1. S.-J. Chung 1989 NP-completeness of the linear complementarity problem J. Optim. Theory Appl. 60 393 399
2. Horst R., Pardalos P., Thoai N.V.: Introduction to Global Optimization. Kluwer, Dordrecht (1995)
3. ILOG: Incline Village, Nevada. ILOG CPLEX 9.0. User's Manual (2003). http://www.ilog.com/products/cplex/
4. Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969) [Reprint: SIAM Classic Appl. Math., vol. 10, Philadelphia (1994)]
5. O.L. Mangasarian 1995 The linear complementarity problem as a separable bilinear program J. Global Optim. 6 153 161
6. Mangasarian, O.L.: Machine learning via polyhedral concave minimization. In: Fischer, H., Riedmueller, B., Schaeffler, S. (eds.) Applied Mathematics and Parallel Computing-Festschrift for Klaus Ritter, pp. 175-188. Physica-Verlag A Springer-Verlag Company, Heidelberg (1996). ftp://ftp.cs.wisc.edu/math-prog/ tech-reports/95-20.ps
7. Mangasarian, O.L.: Solution of general linear complementarity problems via nondifferentiable concave minimization. Acta Math. Vietnam. 22(1), 199-205 (1997). ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-10.ps
8. Mangasarian, O.L.: Minimum-support solutions of polyhedral concave programs. Optimization 45, 149-162 (1999). ftp://ftp.cs.wisc.edu/math-prog/tech- reports/97-05.ps
9. Mangasarian, O.L.: Absolute value equation solution via concave minimization. Optim. Lett. 1(1), 3-8 (2007). ftp://ftp.cs.wisc.edu/pub/dmi/tech- reports/06-02.pdf
10. Mangasarian, O.L.: A generlaized newton method for absolute value equations. Optim. Lett. (to appear). Technical Report 08-01, Data Mining Institute, Computer Sciences Department, University of Wisconsin, May 2008. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/08-01.pdf
11. Mangasarian, O.L., Meyer, R.R.: Absolute value equations. Linear Algebra Appl. 419, 359-367 (2006). ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/05-06.pdf
12. MATLAB: User's Guide. The MathWorks, Inc., Natick (1994-2006). http://www.mathworks.com