Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming

DOI10.1142/S179355711850081XzbMath1411.90305OpenAlexW2755033331MaRDI QIDQ4562766

Clavel Quintana, Rómulo A. Castillo

Publication date: 18 December 2018

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179355711850081x

zbMATH Keywords

multiobjective programmingproximal point methodscalar representations

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (1)

Solving the multi-objective stochastic interval-valued linear fractional integer programming problem

Cites Work

• Unnamed Item
• A logarithmic-quadratic proximal point scalarization method for multiobjective programming
• A logarithmic-quadratic proximal method for variational inequalities
• Nonlinear multiobjective optimization
• Variational methods in partially ordered spaces
• A class of smoothing functions for nonlinear and mixed complementarity problems
• A survey of recent developments in multiobjective optimization
• Proximal Minimization Methods with Generalized Bregman Functions
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Entropy-Like Proximal Methods in Convex Programming
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• Multicriteria Optimization
• Proximal Methods in Vector Optimization
• Convex Analysis
• Benchmarking optimization software with performance profiles.

This page was built for publication: Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming