Newton-like methods for solving vector optimization problems
From MaRDI portal
Recommendations
- Newton-like methods for efficient solutions in vector optimization
- A Newton-like method for variable order vector optimization problems
- A quadratically convergent Newton method for vector optimization
- Newton-Type Methods for Optimization and Variational Problems
- Newton's method for convex optimization
- Optimal Newton-type methods for solving nonlinear equations
- On the application of Newton's method to a class of optimization problems
- The Newton-type methods for problems of mathematical programming
- Newton's method for singular constrained optimization problems
- Newton's Method for Large Bound-Constrained Optimization Problems
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- A projected gradient method for vector optimization problems
- A quadratically convergent Newton method for vector optimization
- A steepest descent method for vector optimization
- A survey of recent developments in multiobjective optimization
- Approximate proximal methods in vector optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Critical points index for vector functions and vector optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Hölder continuity of the unique solution to parametric vector quasiequilibrium problems via nonlinear scalarization
- Inexact projected gradient method for vector optimization
- Newton's method for multiobjective optimization
- Newton-like methods for efficient solutions in vector optimization
- On the convergence of the projected gradient method for vector optimization
- Proximal Methods in Vector Optimization
- Quasi-Newton methods for solving multiobjective optimization
- Recent Developments in Vector Optimization
- Slow solutions of a differential inclusion and vector optimization
- Steepest descent methods for critical points in vector optimization problems
- Steepest descent methods for multicriteria optimization.
- Theory of multiobjective optimization
Cited in
(21)- Conditional gradient method for vector optimization
- An accelerated augmented Lagrangian method for multi-criteria optimization problem
- The Dai–Liao-type conjugate gradient methods for solving vector optimization problems
- Multiobjective BFGS method for optimization on Riemannian manifolds
- Nonlinear scalarization with applications to Hölder continuity of approximate solutions
- A Newton method for capturing Pareto optimal solutions of fuzzy multiobjective optimization problems
- Newton-Type Methods for Optimization and Variational Problems
- A quadratically convergent Newton method for vector optimization
- A study of Liu-Storey conjugate gradient methods for vector optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Spectral conjugate gradient methods for vector optimization problems
- Newton-like methods for efficient solutions in vector optimization
- A strongly convergent proximal point method for vector optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- A Newton-like method for variable order vector optimization problems
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- Multiobjective conjugate gradient methods on Riemannian manifolds
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Cubic regularization technique of the Newton method for vector optimization
This page was built for publication: Newton-like methods for solving vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875559)
