Newton's method for multiobjective optimization
From MaRDI portal
Publication:3563897
DOI10.1137/08071692XzbMATH Open1195.90078OpenAlexW2004586020MaRDI QIDQ3563897FDOQ3563897
Authors: Jörg Fliege, L. M. Graña Drummond, B. F. Svaiter 
Publication date: 1 June 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/08071692x
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
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)
Cited In (only showing first 100 items - show all)
- Trust region methods for solving multiobjective optimisation
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
- Conditional gradient method for 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
- Charnes-Cooper scalarization and convex vector optimization
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Newton's method for variational inequality problems: Smale's point estimate theory under the \(\gamma\)-condition
- Proximal gradient methods for multiobjective optimization and their applications
- Steepest descent methods for critical points in vector optimization problems
- Multicriteria optimization with a multiobjective golden section line search
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- A method for constrained multiobjective optimization based on SQP techniques
- A subgradient method for multiobjective optimization on Riemannian manifolds
- A research survey: review of flexible job shop scheduling techniques
- Multiple reduced gradient method for multiobjective optimization problems
- Barzilai and Borwein's method for multiobjective optimization problems
- Quasi-Newton's method for multiobjective optimization
- An adaptive nonmonotone line search for multiobjective optimization problems
- 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
- An interior proximal method in vector optimization
- A quadratically convergent Newton method for vector optimization
- A steepest descent-like method for variable order vector optimization problems
- A proximal point-type method for multicriteria optimization
- An external penalty-type method for multicriteria
- A sequential quadratic programming method for constrained multi-objective optimization problems
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- A weighting subgradient algorithm for multiobjective optimization
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Spectral conjugate gradient methods for vector optimization problems
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- A steepest descent-like method for vector optimization problems with variable domination structure
- Quasi-Newton methods for solving multiobjective optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Newton-like methods for efficient solutions in vector optimization
- A relaxed projection method for solving multiobjective optimization problems
- A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems
- Quadratic scalarization for decomposed multiobjective optimization
- An efficient hybrid algorithm for multiobjective optimization problems with upper and lower bounds in engineering
- Combined gradient methods for multiobjective optimization
- A barrier-type method for multiobjective optimization
- Newton-like methods for solving vector optimization problems
- A modified Quasi-Newton method for vector optimization problem
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- 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
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Improved front steepest descent for multi-objective optimization
- Pareto front approximation through a multi-objective augmented Lagrangian method
- A Newton-like method for variable order vector optimization problems
- A memetic procedure for global multi-objective optimization
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- Inexact projected gradient method for vector optimization
- Nonsmooth multiobjective programming with quasi-Newton methods
- Multiobjective conjugate gradient methods on Riemannian manifolds
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Reduced Jacobian method
- The gradient subspace approximation and its application to bi-objective optimization problems
- Quasi-Newton methods for multiobjective optimization problems
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems
- A cutting-plane method to nonsmooth multiobjective optimization problems
- A novel hybrid algorithm for solving multiobjective optimization problems with engineering applications
- On the convergence of the projected gradient method for vector optimization
- Complexity of gradient descent for multiobjective optimization
- Hypervolume maximization via set based Newton's method
- Title not available (Why is that?)
- 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
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- A line search technique for a class of multi-objective optimization problems using subgradient
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- An inexact proximal point method for quasiconvex multiobjective optimization
- A proximal gradient splitting method for solving convex vector optimization problems
- An introduction to multiobjective simulation optimization
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
- A nonmonotone gradient method for constrained multiobjective optimization problems
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- Tracing locally Pareto-optimal points by numerical integration
- Title not available (Why is that?)
- Multiobjective BFGS method for optimization on Riemannian manifolds
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Multi agent collaborative search
- A Newton method for capturing Pareto optimal solutions of fuzzy multiobjective optimization problems
- DTSMA: dominant swarm with adaptive T-distribution mutation-based slime mould algorithm
- Twenty years of continuous multiobjective optimization in the twenty-first century
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- Accelerated nonmonotone line search technique for multiobjective optimization
- An accelerated proximal gradient method for multiobjective optimization
- The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning
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)
