On q-steepest descent method for unconstrained multiobjective optimization problems
From MaRDI portal
On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
Recommendations
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- The q-gradient vector for unconstrained continuous optimization problems
- Global optimization using \(q\)-gradients
- Steepest descent methods for multicriteria optimization.
- On the convergence of steepest descent methods for multiobjective optimization
Cites work
- A bicriterial optimization problem of antenna design
- A modified Quasi-Newton method for vector optimization problem
- A 𝑞-sampling theorem related to the 𝑞-Hankel transform
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A steepest descent method for vector optimization
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- An efficient sampling approach to multiobjective optimization
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Applications of q-calculus in operator theory
- Applications of q-Taylor theorems
- Complexity of gradient descent for multiobjective optimization
- Dominating sets for convex functions with some applications
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Fractional integrals and derivatives in \(q\)-calculus
- scientific article; zbMATH DE number 3790227 (Why is no real title available?)
- scientific article; zbMATH DE number 2121237 (Why is no real title available?)
- scientific article; zbMATH DE number 7386007 (Why is no real title available?)
- Integral inequalities in \(q\)-calculus
- Introduction to Unconstrained Optimization with R
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Multicriteria Optimization
- Newton's method for multiobjective optimization
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- On q-Newton--Kantorovich method for solving systems of equations
- On q-Analogues of the Fourier and Hankel Transforms
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Quasi-Newton's method for multiobjective optimization
- Steepest descent methods for critical points in vector optimization problems
- Steepest descent methods for multicriteria optimization.
- Variational q-calculus.
Cited in
(8)- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- The existence of nonnegative solutions for a nonlinear fractional \(q\)-differential problem via a different numerical approach
- Global optimization using \(q\)-gradients
- The q-gradient vector for unconstrained continuous optimization problems
- A line search technique for a class of multi-objective optimization problems using subgradient
- A modified Fletcher-Reeves conjugate gradient method for unconstrained optimization with applications in image restoration.
- On the convergence of steepest descent methods for multiobjective optimization
This page was built for publication: On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2132125)