A modified Quasi-Newton method for vector optimization problem

References

• Geoffrion AM. Proper efficiency and the theory of vector maximization. J. Optim. Theory Appl. 1968;22:618–630.
   Web of Science ®Google Scholar
• Pascoletti A, Serafini P. Scalarizing vector optimization problems. Struct. Multidisc. Optim. 1984;42:499–524.
   Google Scholar
• Dutta J, Kaya CY. A new scalarization and numerical method for constructing the weak pareto front of multi-objective optimization problems. Optimization. 2011;60:1091–1104.
   Web of Science ®Google Scholar
• Ghaznavi-ghosoni B, Khorram E, Soleimani-damaneh M. Scalarization for characterization of approximate strong/weak/ proper efficiency in multi-objective optimization. Optimization. 2013;62:703–720.
   Web of Science ®Google Scholar
• Luc D, Phong T, Volle M. Scalarizing functions for generating the weakly efficient solution set in convex multiobjective problems. SIAM J. Optim. 2005;15:987–1001.
   Web of Science ®Google Scholar
• Eichfelder G. Scalarizations for adaptively solving multi-objective optimization problems. Comput. Optim. Appl. 2009;44:249–273.
   Web of Science ®Google Scholar
• Evans G. Overview of techniques for solving multiobjective mathematical programs. Management Sci. 1984;30:1268–1282.
   Web of Science ®Google Scholar
• Drummond LMG, Maculan N, Svaiter B. On the choice of parameters for the weighting method in vector optimization. Math. Program. 2008;111:201–216.
   Web of Science ®Google Scholar
• Das I, Dennis J. Normal-boundary intersection: a new method for generating pareto optimal points in nonlinear multicriteria optimization problems. SIAM J. Optim. 1998;8:631–657.
   Web of Science ®Google Scholar
• Siddiqui S, Azarm S, Gabriel SA. On improving normal boundary intersection method for generation of pareto frontier. Struct. Multidisc. Optim. 2012;46:839–852.
   Web of Science ®Google Scholar
• Engau A, Wiecek MM. Generating ϵ-efficient solutions in multiobjective programming. Euro. J. Oper. Res. 2007;177:1566–1579.
   Web of Science ®Google Scholar
• Li Z, Wang S. ϵ-approximate solutions in multiobjective optimization. Optimization. 1998;34:161–174.
   Google Scholar
• Deb K. Multi-objective optimization using evolutionary algorithms. New Delhi: Wiley India; 2003.
   Google Scholar
• Miettinen K. Nonlinear multiobjective optimization. Boston: Kluwer; 1999.
   Google Scholar
• Jahn J. Vector optimization. theory, applications, and extensions. Berlin: Springer; 2004.
   Google Scholar
• Ehrgott M. Multicriteria optimization. Berlin: Springer; 2005.
   Google Scholar
• Qu S, Goh M, Liang B. Trust region methods for solving multiobjective optimisation. Optim. Methods Softw. 2013;28:796–811.
   Web of Science ®Google Scholar
• Povalej Ž. Quasi-Newton’s method for multiobjective optimization. J. Comput. Appl. Math. 2014;255:765–777.
   Web of Science ®Google Scholar
• Qu S, Goh M, Chan FTS. Quasi-Newton methods for solving multiobjective optimization. Oper. Res. Lett. 2011;39:397–399.
   Web of Science ®Google Scholar
• Fliege F, Drummond LMG, Svaiter B. Newton’s method for multiobjective optimization. SIAM J. Optim. 2009;20:602–626.
   Web of Science ®Google Scholar
• Fliege J, Svaiter FV. Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 2000;51:479–494.
   Web of Science ®Google Scholar
• Drummond LMG, Svaiter BF. A steepest descent method for vector optimization. J. Comput. Appl. Math. 2005;175:395–414.
   Web of Science ®Google Scholar
• Miglierina E, Melho E, Recchioni M. Box-constrained multi-objective optimization: a gradient-like method without a priori scalarization. Euro. J. Oper. Res. 2008;188:662–682.
   Web of Science ®Google Scholar
• Bonnel H, Iusem A, Svaiter B. Proximal methods in vector optimization. SIAM J. Optim. 2005;15:953–970.
   Web of Science ®Google Scholar
• Burachik R, Drummond LG, Isuem A, Svaiter B. Full convergence of the steepest descent method with inexact line searches. Optimization. 1995;32:137–146.
   Google Scholar
• Ceng L, Yao J. Approximate proximal methods in vector optimization. Euro. J. Oper. Res. 2007;183:1–19.
   Web of Science ®Google Scholar
• Chuong T, Yao JC. Steepest descent methods for critical points in vector optimization problems. Appl. Anal. 2012;91:1811–1829.
   Web of Science ®Google Scholar
• Chuong T, Mordukhovich B, Yao J. Hybrid approximate proximal algorithms for efficient solutions in vector optimization. J. Nonlinear Convex Anal. 2011;12:257–286.
   Web of Science ®Google Scholar
• Drummond LG, Iusem A. A projected gradient method for vector optimization problems. Comput. Optim. Appl. 2004;28:5–30.
   Web of Science ®Google Scholar
• Gordan P. Über die Auflösungen linearer Gleichungen mit reellen Coefficienten [On the dissolution of linear equations with real coefficients]. Mathematische Annalen. 1873;6:23–28.
   Google Scholar