On \(q\)-Newton's method for unconstrained multiobjective optimization problems

DOI10.1007/s12190-020-01322-xzbMath1475.90095OpenAlexW3003399198MaRDI QIDQ2053032

Geetanjali Panda, Bhagwat Ram, Md Abu Talhamainuddin Ansary, Shashi Kant Mishra

Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-020-01322-x

zbMATH Keywords

optimizationalgorithmsPareto optimalityNewton-type methods\(q\)-calculus

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53) (q)-calculus and related topics (05A30) Methods of reduced gradient type (90C52)

Related Items (3)

Efficient time-varying \(q\)-parameter design for \(q\)-incremental least mean square algorithm with noisy links ⋮ Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets ⋮ A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems

Uses Software

• ASMO

Cites Work

• Unnamed Item
• Global optimization using \(q\)-gradients
• Quasi-Newton methods for solving multiobjective optimization
• Scalarizations for adaptively solving multi-objective optimization problems
• Scalarization of vector optimization problems
• Nonlinear multiobjective optimization
• A bicriterial optimization problem of antenna design
• Dominating sets for convex functions with some applications
• Steepest descent methods for multicriteria optimization.
• A steepest descent method for vector optimization
• Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
• Multi-stage distributionally robust optimization with risk aversion
• Multiobjective DC programs with infinite convex constraints
• Quasi-Newton's method for multiobjective optimization
• Nonsmooth multiobjective programming with quasi-Newton methods
• An efficient sampling approach to multiobjective optimization
• On the choice of parameters for the weighting method in vector optimization
• Proper efficiency and the theory of vector maximization
• On \(q\)-Newton--Kantorovich method for solving systems of equations
• Bi-criteria optimization of open cross section of the thin-walled beams with flat flanges
• Scalarization in vector optimization
• A modified Quasi-Newton method for vector optimization problem
• Newton's Method for Multiobjective Optimization
• An Adaptive Scalarization Method in Multiobjective Optimization
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• A Method for q-Calculus
• A Revised Modified Cholesky Factorization Algorithm
• Newton Like Line Search Method Using q-Calculus
• The q-Gradient Vector for Unconstrained Continuous Optimization Problems
• Generalized homotopy approach to multiobjective optimization.

This page was built for publication: On \(q\)-Newton's method for unconstrained multiobjective optimization problems