Minimizing Piecewise-Concave Functions Over Polyhedra

References

• Bagirov A, Karmitsa N, Mäkelä MM (2014) Introduction to Nonsmooth Optimization (Springer International, Cham, Switzerland).Crossref, Google Scholar
• Bagirov AM, Ganjehlou AN (2010) A quasisecant method for minimizing nonsmooth functions. Optim. Methods and Software 25(1):3–18.Crossref, Google Scholar
• Bandler JW, Kellermann W, Madsen K (1985) A superlinearly convergent minimax algorithm for microwave circuit design. IEEE Trans. Microwave Theory and Techniques 33(12):1519–1530.Crossref, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization. Princeton Series in Applied Mathematics (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Brimberg J, Hansen P, Mladenovic N (2010) Attraction probabilities in variable neighborhood search. 4OR 8(2):181–194.Crossref, Google Scholar
• Czyzyk J, Mesnier MP, More JJ (1998) The NEOS server. IEEE Comput. Sci. Engrg. 5(3):68–75.Crossref, Google Scholar
• Danskin JM (1967) The Theory of Max–Min and Its Application to Weapons Allocation Problems. Econometrics and Operations Research (Springer, Berlin).Crossref, Google Scholar
• De Leone R, Gaudioso M, Grippo L (1984) Stopping criteria for linesearch methods without derivatives. Math. Programming 30(3):285–300.Crossref, Google Scholar
• de Oliveira W, Sagastizábal C (2014) Level bundle methods for oracles with on-demand accuracy. Optim. Methods and Software 29(6):1180–1209.Crossref, Google Scholar
• de Oliveira W, Sagastizábal C, Lemaréchal C (2014) Convex proximal bundle methods in depth: A unified analysis for inexact oracles. Math. Programming 148(1–2):241–277.Crossref, Google Scholar
• de Oliveira W, Solodov M (2016) A doubly stabilized bundle method for nonsmooth convex optimization. Math. Programming 156(1):125–159.Crossref, Google Scholar
• Demyanov AV, Fuduli A, Miglionico G (2007) A bundle modification strategy for convex minimization. Eur. J. Oper. Res. 180(1):38–47.Crossref, Google Scholar
• Demyanov VF, Malozemov VN (1967) Introduction to Minimax (Dover Publications, Mineola, NY).Google Scholar
• Di Pillo G, Grippo L, Lucidi S (1993) A smooth method for the finite minimax problem. Math. Programming 60(2):187–214.Crossref, Google Scholar
• Dolan ED (2001) The NEOS server 4.0 administrative guide. Technical Memorandum ANL/MCS-TM-250, Argonne National Laboratory, Mathematics and Computer Science Division.Google Scholar
• Du DZ, Hwang FK (1992) A proof of the Gilbert-Pollak conjecture on the Steiner ratio. Algorithmica 7(2–3):121–135.Crossref, Google Scholar
• Du DZ, Pardalos PM, eds. (1995) Minimax and Applications (Nonconvex Optimization and Its Applications), Vol. 4 (Kluwer Academic Publishers, Dordrecht, Netherlands).Google Scholar
• Fortin D, Tsevendorj I (2009) Piecewise convex maximization approach to multiknapsack. Optimization 58(7):883–895.Crossref, Google Scholar
• Fortin D, Tsevendorj I (2011) Piecewise convex maximization problems: Piece adding technique. J. Optim. Theory Appl. 148(3):471–487.Crossref, Google Scholar
• Fortin D, Tsevendorj I (2002) Piecewise-convex maximization problems: Algorithm and computational experiments. J. Global Optim. 24(1):61–77.Crossref, Google Scholar
• Fortin D, Tsevendorj I (2004) Global optimization and multi knapsack: A percolation algorithm. Eur. J. Oper. Res. 154(1):46–56.Crossref, Google Scholar
• Frangioni A (2002) Generalized bundle methods. SIAM J. Optim. 13(1):117–156.Crossref, Google Scholar
• Fuduli A, Gaudioso M, Giallombardo G (2004) A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization. Optim. Methods and Software 19(1):89–102.Crossref, Google Scholar
• Fuduli A, Gaudioso M, Giallombardo G (2004) Minimizing nonconvex nonsmooth functions via cutting planes and proximity control. SIAM J. Optim. 14(3):743–756.Crossref, Google Scholar
• Fuduli A, Gaudioso M, Giallombardo G, Miglionico G (2015) A partially inexact bundle method for convex semi-infinite minmax problems. Commun. Nonlinear Sci. Numerical Simulation 21(1–3):172–180.Crossref, Google Scholar
• Gaudioso M, Giallombardo G, Miglionico G (2006) An incremental method for solving convex finite min–max problems. Math. Oper. Res. 31(1):173–187.Link, Google Scholar
• Gaudioso M, Giallombardo G, Miglionico G (2009a) On solving the Lagrangian dual of integer programs via an incremental approach. Comput. Optim. Appl. 44(1):117–138.Crossref, Google Scholar
• Gaudioso M, Gorgone E, Monaco MF (2009b) Piecewise linear approximations in nonconvex nonsmooth optimization. Numerische Mathematik 113(1):73–88.Crossref, Google Scholar
• Georgiev PG, Pardalos PM, Chinchuluun A (2008) Localization of minimax points. J. Global Optim. 40(1–3):489–494.Crossref, Google Scholar
• Hald J, Madsen K (1981) Combined LP and quasi-Newton methods for minimax optimization. Math. Programming 20(1):49–62.Crossref, Google Scholar
• Hansen P, Mladenović N (2001) Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130(3):449–467.Crossref, Google Scholar
• Hare W, Sagastizábal C (2009) Computing proximal points of nonconvex functions. Math. Programming 116(1–2):221–258.Crossref, Google Scholar
• Hare W, Sagastizábal C (2010) A redistributed proximal bundle method for nonconvex optimization. SIAM J. Optim. 20(5):2442–2473.Crossref, Google Scholar
• Hiriart-Urruty JB, Lemaréchal C (1993) Convex Analysis and Minimization Algorithms. I–II (Springer, Berlin).Crossref, Google Scholar
• Hoffman KL (1981) A method for globally minimizing concave functions over convex sets. Math. Programming 20(1):22–32.Crossref, Google Scholar
• IBM Ilog Cplex Optimizer (v. 12.6) http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/.Google Scholar
• Karmitsa N, Bagirov A, Mäkelä MM (2012) Comparing different nonsmooth minimization methods and software. Optim. Methods and Software 27(1):131–153.Crossref, Google Scholar
• Kiwiel KC (1995) Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math. Programming 69(1):89–109.Crossref, Google Scholar
• Kiwiel KC (2006) A proximal bundle method with approximate subgradient linearizations. SIAM J. Optim. 16(4):1007–1023.Crossref, Google Scholar
• Mifflin R (1982) A modification and an extension of Lemaréchal’s algorithm for nonsmooth minimization. Sorensen DC, Wets RJB, eds. Nondifferential and Variational Techniques in Optimization (Springer, Berlin), 77–90.Crossref, Google Scholar
• Mladenović N, Hansen P (1997) Variable neighborhood search. Comput. Oper. Res. 24(11):1097–1100.Crossref, Google Scholar
• Mladenović N, Dražić M, Kovačevic-Vujčić V, Čangalović M (2008) General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. 191(3):753–770.Crossref, Google Scholar
• Nedić A, Bertsekas DP (2001) Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12(1):109–138.Crossref, Google Scholar
• Nedić A, Bertsekas DP (2010) The effect of deterministic noise in subgradient methods. Math. Programming 125(1):75–99.Crossref, Google Scholar
• Osborne M, Watson G (1969) An algorithm for minimax optimization in the nonlinear case. Comput. J. 12(1):63–68.Crossref, Google Scholar
• Polak E (1987) On the mathematical foundations of nondifferentiable optimization in engineering design. SIAM Rev. 29(1):21–89.Crossref, Google Scholar
• Schramm H, Zowe J (1992) A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2(1):121–152.Crossref, Google Scholar
• Sergeyev Y, Kvasov D (2008) Diagonal Global Optimization Methods (FizMatLit, Moscow).Google Scholar
• Takeda A, Taguchi S, Tütüncü RH (2008) Adjustable robust optimization models for a nonlinear two-period system. J. Optim. Theory Appl. 136(2):275–295.Crossref, Google Scholar
• Tardella F (2000) Piecewise concavity and discrete approaches to continuous minimax problems. Pardalos PM, ed. Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Springer, Boston), 511–524.Crossref, Google Scholar
• Thoai NV, Ty H (1980) Convergent algorithms for minimizing a concave function. Math. Oper. Res. 5(4):556–566.Link, Google Scholar
• Tsevendorj I (2001) Piecewise-convex maximization problems: Global optimality conditions. J. Global Optim. 21(1):1–14.Crossref, Google Scholar
• Wolfe P (1975) A method of conjugate subgradients for minimizing nondifferentiable functions. Math. Programming Study 3:145–173.Crossref, Google Scholar
• Zangwill WI (1967) The piecewise concave function. Management Sci. 13(11):900–912.Link, Google Scholar