A tunneling method for nonlinear multi-objective optimization problems

DOI10.4310/AMSA.260804063510MaRDI QIDQ7325304zbMATH OpenFDO

Authors Bikram Adhikary, Md Abu Talhamainuddin Ansary

Publication date 7 September 2026

Published in Annals of Mathematical Sciences and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/AMSA.260804063510

Mathematics Subject Classification ID

Numerical methods in optimal control (49M99) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Cites work

• A conic scalarization method in multi-objective optimization
• A filled function method for finding a global minimizer of a function of several variables
• A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
• A method for constrained multiobjective optimization based on SQP techniques
• A modified Quasi-Newton method for vector optimization problem
• A new filled function method for unconstrained global optimization
• A new scalarization method for finding the efficient frontier in non-convex multi-objective problems
• A Newton method for uncertain multiobjective optimization problems with finite uncertainty sets
• A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
• A proximal point-type method for multicriteria optimization
• A sequential quadratic programming method for constrained multi-objective optimization problems
• A statistical model-based algorithm for `black-box' multi-objective optimisation
• Benchmarking Derivative-Free Optimization Algorithms
• Comparison of some scalarization methods in multiobjective optimization
• Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
• Convergence of stochastic search algorithms to finite size Pareto set approximations
• Generalized homotopy approach to multiobjective optimization.
• Global descent method for constrained continuous global optimization
• Global descent method for global optimization
• Newton's method for multiobjective optimization
• Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
• Non parameter-filled function for global optimization
• Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
• Proximal gradient methods for multiobjective optimization and their applications
• Steepest descent methods for multicriteria optimization.
• The Tunneling Algorithm for the Global Minimization of Functions

This page was built for publication: A tunneling method for nonlinear multi-objective optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325304)