Newton's method for multiobjective optimization
From MaRDI portal
multicriteria optimizationmultiobjective programmingNewtons methodoptimality conditionPareto pointsquadratic approximationscalarization
Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
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)- Multiple reduced gradient method for multiobjective optimization problems
- Reduced Jacobian method
- A Newton-like method for variable order vector optimization problems
- An efficient hybrid algorithm for multiobjective optimization problems with upper and lower bounds in engineering
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A cutting-plane method to nonsmooth multiobjective optimization problems
- A novel hybrid algorithm for solving multiobjective optimization problems with engineering applications
- Quasi-Newton methods for multiobjective optimization problems
- A weighting subgradient algorithm for multiobjective optimization
- A relaxed projection method for solving multiobjective optimization problems
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems
- Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- Conditional gradient method for multiobjective optimization
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- A strongly convergent proximal point method for vector optimization
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- A sequential quadratic programming method for constrained multi-objective optimization problems
- Multi-criteria optimization in regression
- Globally convergent Newton-type methods for multiobjective optimization
- Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem
- Combined gradient methods for multiobjective optimization
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
- DTSMA: dominant swarm with adaptive T-distribution mutation-based slime mould algorithm
- On q-steepest descent method for unconstrained multiobjective optimization problems
- On inexact projected gradient methods for solving variable vector optimization problems
- Expensive multi-objective optimization of electromagnetic mixing in a liquid metal
- A study of Liu-Storey conjugate gradient methods for vector optimization
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Quasi-Newton's method for multiobjective optimization
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Nonsmooth multiobjective programming with quasi-Newton methods
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Inexact projected gradient method for vector optimization
- Newton-like methods for efficient solutions in vector optimization
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
- Proximal gradient methods for multiobjective optimization and their applications
- Robust multiobjective optimization \& applications in portfolio optimization
- Barzilai and Borwein's method for multiobjective optimization problems
- An adaptive nonmonotone line search for multiobjective optimization problems
- A trust region method for solving multicriteria optimization problems on Riemannian manifolds
- Convergence rates analysis of a multiobjective proximal gradient method
- Memory gradient method for multiobjective optimization
- A limited memory quasi-Newton approach for multi-objective optimization
- A research survey: review of flexible job shop scheduling techniques
- A method for constrained multiobjective optimization based on SQP techniques
- Trust region methods for solving multiobjective optimisation
- Newton-like methods for solving vector optimization problems
- Multi agent collaborative search
- An external penalty-type method for multicriteria
- On the convergence of the projected gradient method for vector optimization
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- Steepest descent methods for critical points in vector optimization problems
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Inertial forward–backward methods for solving vector optimization problems
- Quadratic scalarization for decomposed multiobjective optimization
- Tracing locally Pareto-optimal points by numerical integration
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- Hybrid proximal point algorithm for solution of convex multiobjective optimization problem over fixed point constraint
- A modified Quasi-Newton method for vector optimization problem
- Multi agent collaborative search based on Tchebycheff decomposition
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Quasi-Newton methods for solving multiobjective optimization
- A trust-region algorithm for heterogeneous multiobjective optimization
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- A steepest descent-like method for variable order vector optimization problems
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- scientific article; zbMATH DE number 194557 (Why is no real title available?)
- scientific article; zbMATH DE number 1390501 (Why is no real title available?)
- A proximal gradient splitting method for solving convex vector optimization problems
- On high-order model regularization for multiobjective optimization
- A steepest descent-like method for vector optimization problems with variable domination structure
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Using first-order information in direct multisearch for multiobjective optimization
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A conjugate directions-type procedure for quadratic multiobjective optimization
- Strong and weak conditions of regularity and optimality
- The gradient subspace approximation and its application to bi-objective optimization problems
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- A barrier-type method for multiobjective optimization
- A quadratically convergent Newton method for vector optimization
- Newton's method for variational inequality problems: Smale's point estimate theory under the -condition
- Hypervolume maximization via set based Newton's method
- A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems
- Complexity of gradient descent for multiobjective optimization
- Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- A Newton method for capturing Pareto optimal solutions of fuzzy multiobjective optimization problems
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
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)
