Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
From MaRDI portal
Publication:6659765
DOI10.1007/S40314-024-03018-5MaRDI QIDQ6659765
Maria Eduarda Pinheiro, Geovani Nunes Grapiglia
Publication date: 9 January 2025
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- Survey of multi-objective optimization methods for engineering
- Universal gradient methods for convex optimization problems
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- A proximal point-type method for multicriteria optimization
- An augmented Lagrangian algorithm for multi-objective optimization
- Steepest descent methods for multicriteria optimization.
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- Optimal multi-objective low-thrust spacecraft trajectories
- On the worst-case evaluation complexity of non-monotone line search algorithms
- A projected gradient method for vector optimization problems
- A generalized worst-case complexity analysis for non-monotone line searches
- A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Inexact projected gradient method for vector optimization
- Direct Multisearch for Multiobjective Optimization
- On the convergence of the projected gradient method for vector optimization
- Newton's Method for Multiobjective Optimization
- Testing Unconstrained Optimization Software
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- On high-order model regularization for multiobjective optimization
- Complexity of gradient descent for multiobjective optimization
- Proximal Methods in Vector Optimization
- JuMP: A Modeling Language for Mathematical Optimization
- Optimality conditions for \(C^{1,1}\) vector optimization problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659765)