Inexact projected gradient method for vector optimization
From MaRDI portal
(Redirected from Publication:2377166)
Recommendations
- On inexact projected gradient methods for solving variable vector optimization problems
- A projected gradient method for vector optimization problems
- On the convergence of the projected gradient method for vector optimization
- A subgradient method for vector optimization problems
- A steepest descent method for vector optimization
Cites work
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 47208 (Why is no real title available?)
- scientific article; zbMATH DE number 2096864 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A bicriterial optimization problem of antenna design
- A projected gradient method for vector optimization problems
- A quadratically convergent Newton method for vector optimization
- 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 Existence Theorem in Vector Optimization
- An efficient sampling approach to multiobjective optimization
- Convex Analysis
- Dominating sets for convex functions with some applications
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Equilibrium analysis in financial markets with countably many securities
- Full convergence of the steepest descent method with inexact line searches
- General equilibrium analysis in ordered topological vector spaces
- Newton's method for multiobjective optimization
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- On the choice of parameters for the weighting method in vector optimization
- On the convergence of the projected gradient method for vector optimization
- Scalarization in vector optimization
- Scalarization of vector optimization problems
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Steepest descent methods for multicriteria optimization.
- Theory of multiobjective optimization
Cited in
(62)- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- On the convergence of the projected gradient method for vector optimization
- Nonlinear conjugate gradient method for vector optimization on Riemannian manifolds with retraction and vector transport
- Conditional gradient method for vector optimization
- Efficient nonlinear conjugate gradient techniques for vector optimization problems
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- The Dai–Liao-type conjugate gradient methods for solving vector optimization problems
- A generalized conditional gradient method for multiobjective composite optimization problems
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications
- Multiobjective BFGS method for optimization on Riemannian manifolds
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- On inexact projected gradient methods for solving variable vector optimization problems
- A vector restricted variant MVHS+ CG method based algorithm for unconstrained vector optimization problems
- An accelerated proximal gradient method for multiobjective optimization
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- A proximal point-type method for multicriteria optimization
- An external penalty-type method for multicriteria
- A study of Liu-Storey conjugate gradient methods for vector optimization
- Conditional gradient method for multiobjective optimization
- A sequential quadratic programming method for constrained multi-objective optimization problems
- A weighting subgradient algorithm for multiobjective optimization
- Proximal point method for vector optimization on Hadamard manifolds
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds
- Spectral conjugate gradient methods for vector optimization problems
- A nonmonotone line search method for constrained multiobjective optimization problems
- A relaxed projection method for solving multiobjective optimization problems
- A nonlinear conjugate gradient algorithm for multiobjective optimization: multiple hybrid search direction and global rates
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization
- Newton-like methods for solving vector optimization problems
- A barrier-type method for multiobjective optimization
- On the extension of Dai-Liao conjugate gradient method for vector optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- A subgradient method for vector optimization problems
- Inertial version of generalized projected reflected gradient method
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
- A projected gradient method for vector optimization problems
- An augmented Lagrangian algorithm for multi-objective optimization
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- A proximal gradient method with an explicit line search for multiobjective optimization
- 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
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- A memetic procedure for global multi-objective optimization
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- Globally convergent Newton-type methods for multiobjective optimization
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Inexact version of Bregman proximal gradient algorithm
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- Inexact gradient projection method with relative error tolerance
- Multiobjective conjugate gradient methods on Riemannian manifolds
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- A nonmonotone projected gradient method for multiobjective problems on convex sets
This page was built for publication: Inexact projected gradient method for vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377166)
