An inexact proximal point method for quasiconvex multiobjective optimization
From MaRDI portal
Recommendations
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- A scalarization proximal point method for quasiconvex multiobjective minimization
Cites work
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- A new accuracy criterion for approximate proximal point algorithms
- A projected gradient method for vector optimization problems
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- A proximal point-type method for multicriteria optimization
- A scalarization proximal point method for quasiconvex multiobjective minimization
- A strongly convergent proximal point method for vector optimization
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
- An implementable proximal point algorithmic framework for nuclear norm minimization
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- An interior proximal method in vector optimization
- Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity
- Approximate proximal methods in vector optimization
- Clarke's Gradients and Epsilon-Subgradients in Banach Spaces
- Direct Multisearch for Multiobjective Optimization
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 2006093 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Inexact accelerated high-order proximal-point methods
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Microeconomic theory
- Monotone Operators and the Proximal Point Algorithm
- Newton's method for multiobjective optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- Proximal Methods in Vector Optimization
- Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
- Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems
- Proximité et dualité dans un espace hilbertien
- Quasi-Concave Programming
- Quasiconvex optimization and location theory
- Rate of convergence for proximal point algorithms on Hadamard manifolds
- Ridge regression in two-parameter solution
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Steepest descent methods for multicriteria optimization.
- Testing Unconstrained Optimization Software
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- Variational Analysis
- Vector Optimization
- Vector optimization. Set-valued and variational analysis.
- ε-Subdifferential and ε-monotonicity
Cited in
(4)- An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials
- An inexact proximal point method with quasi-distance for quasiconvex multiobjective optimization problems on Riemannian manifolds
- Projected quasi-subgradient method for Hölder continuous quasi-convex multiobjective optimization
This page was built for publication: An inexact proximal point method for quasiconvex multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576420)
