Newton's method for multiobjective optimization
From MaRDI portal
Publication:3563897
optimality conditionmulticriteria optimizationmultiobjective programmingscalarizationquadratic approximationPareto pointsNewtons method
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30)
Recommendations
- Quasi-Newton's method for multiobjective optimization
- Globally convergent Newton-type methods for multiobjective optimization
- A quadratically convergent Newton method for vector optimization
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- A new quasi-Newton's method for unconstrained multiobjective optimization
Cited in
(only showing first 100 items - show all)- A barrier-type method for multiobjective optimization
- Multiobjective optimization with least constraint violation: optimality conditions and exact penalization
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
- On necessary optimality conditions for sets of points in multiobjective optimization
- On the extension of Dai-Liao conjugate gradient method for vector optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- A modified Quasi-Newton method for vector optimization problem
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
- New merit functions for multiobjective optimization and their properties
- A trust region method for solving multicriteria optimization problems on Riemannian manifolds
- Proximal Newton methods for multiobjective optimization problems
- An augmented Lagrangian algorithm for multi-objective optimization
- On the convergence of steepest descent methods for multiobjective optimization
- Multi agent collaborative search based on Tchebycheff decomposition
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem
- Uniform weak sharp minima for multiobjective optimization problems
- Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- A Newton-like method for variable order vector optimization problems
- Convergence rates analysis of a multiobjective proximal gradient method
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- Multi-criteria optimization in regression
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Improved front steepest descent for multi-objective optimization
- Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization
- Pareto front approximation through a multi-objective augmented Lagrangian method
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- A memetic procedure for global multi-objective optimization
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
- Inertial forward–backward methods for solving vector optimization problems
- Inexact projected gradient method for vector optimization
- A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
- Globally convergent Newton-type methods for multiobjective optimization
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- Strict efficiency in vector optimization via a directional curvature functional
- Variable metric method for unconstrained multiobjective optimization problems
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Nonsmooth multiobjective programming with quasi-Newton methods
- Memory gradient method for multiobjective optimization
- A limited memory quasi-Newton approach for multi-objective optimization
- Multiobjective conjugate gradient methods on Riemannian manifolds
- MOEA/D with gradient-enhanced kriging for expensive multiobjective optimization
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- Reduced Jacobian method
- Using first-order information in direct multisearch for multiobjective optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- A nonmonotone projected gradient method for multiobjective problems on convex sets
- The gradient subspace approximation and its application to bi-objective optimization problems
- Quasi-Newton methods for multiobjective optimization problems
- Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems
- A conjugate directions-type procedure for quadratic multiobjective optimization
- A cutting-plane method to nonsmooth multiobjective optimization problems
- A novel hybrid algorithm for solving multiobjective optimization problems with engineering applications
- On high-order model regularization for multiobjective optimization
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint
- On the convergence of the projected gradient method for vector optimization
- An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation
- Trust region methods for solving multiobjective optimisation
- Complexity of gradient descent for multiobjective optimization
- Hypervolume maximization via set based Newton's method
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
- Charnes-Cooper scalarization and convex vector optimization
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems
- scientific article; zbMATH DE number 1390501 (Why is no real title available?)
- Conditional gradient method for vector optimization
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- A line search technique for a class of multi-objective optimization problems using subgradient
- Proximal gradient methods for multiobjective optimization and their applications
- Newton's method for variational inequality problems: Smale's point estimate theory under the \(\gamma\)-condition
- Steepest descent methods for critical points in vector optimization problems
- Multicriteria optimization with a multiobjective golden section line search
- A proximal gradient splitting method for solving convex vector optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
- An inexact proximal point method for quasiconvex multiobjective optimization
- An introduction to multiobjective simulation optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Tracing locally Pareto-optimal points by numerical integration
- A method for constrained multiobjective optimization based on SQP techniques
This page was built for publication: Newton's method for multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563897)
