Cubic regularization technique of the Newton method for vector optimization

DOI10.1007/S10957-025-02726-0MaRDI QIDQ6936068zbMATH OpenFDO

Authors Debdas Ghosh

Publication date 2 September 2025

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-025-02726-0

zbMATH Keywords

cubic regularizationLipschitz HessianNewton methodnon-convex programmingquadratic convergencevector optimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Methods of quasi-Newton type (90C53)

Cites work

• A new Pareto set generating method for multi-criteria optimization problems
• A Newton method for uncertain multiobjective optimization problems with finite uncertainty sets
• A projected gradient method for vector optimization problems
• A quadratically convergent Newton method for vector optimization
• A steepest descent method for vector optimization
• A subgradient method for vector optimization problems
• A trust-region approach for computing Pareto fronts in multiobjective derivative-free optimization
• A trust-region approach for computing Pareto fronts in multiobjective optimization
• A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
• Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization
• Complexity of gradient descent for multiobjective optimization
• Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization
• Cubic regularization of Newton method and its global performance
• Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
• Globally convergent Newton-type methods for multiobjective optimization
• New hybrid conjugate gradient algorithm for vector optimization problems
• Newton's method for multiobjective optimization
• Newton-like methods for solving vector optimization problems
• Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality
• Nonlinear Conjugate Gradient Methods for Vector Optimization
• On the convergence analysis of a proximal gradient method for multiobjective optimization
• Performance indicators in multiobjective optimization
• Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
• Quasi-Newton methods for solving multiobjective optimization
• Steepest descent methods for critical points in vector optimization problems
• Steepest descent methods for multicriteria optimization.
• Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
• Trust region methods for solving multiobjective optimisation
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization

This page was built for publication: Cubic regularization technique of the Newton method for vector optimization

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