On q-Newton's method for unconstrained multiobjective optimization problems
From MaRDI portal
Publication:2053032
Recommendations
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
- A new quasi-Newton's method for unconstrained multiobjective optimization
- On \(q\)-BFGS algorithm for unconstrained optimization problems
- Quasi-Newton's method for multiobjective optimization
- A \(q\)-conjugate gradient algorithm for unconstrained optimization problems
Cites work
- scientific article; zbMATH DE number 47208 (Why is no real title available?)
- A Method for q-Calculus
- A Revised Modified Cholesky Factorization Algorithm
- A bicriterial optimization problem of antenna design
- A modified Quasi-Newton method for vector optimization problem
- A steepest descent method for vector optimization
- An Adaptive Scalarization Method in Multiobjective Optimization
- An efficient sampling approach to multiobjective optimization
- Bi-criteria optimization of open cross section of the thin-walled beams with flat flanges
- Dominating sets for convex functions with some applications
- Generalized homotopy approach to multiobjective optimization.
- Global optimization using \(q\)-gradients
- Multi-stage distributionally robust optimization with risk aversion
- Multiobjective DC programs with infinite convex constraints
- Newton like line search method using \(q\)-calculus
- Newton's method for multiobjective optimization
- Nonlinear multiobjective optimization
- Nonsmooth multiobjective programming with quasi-Newton methods
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On \(q\)-Newton--Kantorovich method for solving systems of equations
- On the choice of parameters for the weighting method in vector optimization
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Proper efficiency and the theory of vector maximization
- Quasi-Newton methods for solving multiobjective optimization
- Quasi-Newton's method for multiobjective optimization
- Scalarization in vector optimization
- Scalarization of vector optimization problems
- Scalarizations for adaptively solving multi-objective optimization problems
- Steepest descent methods for multicriteria optimization.
- The \(q\)-gradient vector for unconstrained continuous optimization problems
Cited in
(11)- A \(q\)-conjugate gradient algorithm for unconstrained optimization problems
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
- On \(q\)-BFGS algorithm for unconstrained optimization problems
- A line search technique for a class of multi-objective optimization problems using subgradient
- Efficient time-varying \(q\)-parameter design for \(q\)-incremental least mean square algorithm with noisy links
- Newton like line search method using \(q\)-calculus
- A new quasi-Newton's method for unconstrained multiobjective optimization
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
- A modified Fletcher-Reeves conjugate gradient method for unconstrained optimization with applications in image restoration.
- The \(q\)-gradient vector for unconstrained continuous optimization problems
This page was built for publication: On \(q\)-Newton's 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 Q2053032)
