An interior proximal method in vector optimization
From MaRDI portal
(Redirected from Publication:635150)
Recommendations
Cites work
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A steepest descent method for vector optimization
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- Approximate proximal methods in vector optimization
- Bregman functions and auxiliary problem principle
- Bregman-like functions and proximal methods for variational problems with nonlinear constraints
- Characterizations of solution sets of convex vector minimization problems
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of Proximal-Like Algorithms
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Interior proximal method for variational inequalities on non-polyhedral sets
- Monotone Operators and the Proximal Point Algorithm
- Newton's method for multiobjective optimization
- Nonlinear economic dynamics
- On inexact generalized proximal methods with a weakened error tolerance criterion
- On the choice of parameters for the weighting method in vector optimization
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Proximal Methods in Vector Optimization
- Proximal Minimization Methods with Generalized Bregman Functions
- Proximité et dualité dans un espace hilbertien
- Vector variational principles; \(\varepsilon\)-efficiency and scalar stationarity
Cited in
(37)- A study of Liu-Storey conjugate gradient methods for vector optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- An inexact algorithm with proximal distances for variational inequalities
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
- A relaxed projection method for solving multiobjective optimization problems
- Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds
- Steepest descent methods for critical points in vector optimization problems
- A proximal point-type method for multicriteria optimization
- scientific article; zbMATH DE number 2201296 (Why is no real title available?)
- An inexact proximal point method for quasiconvex multiobjective optimization
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Proximal point method for vector optimization on Hadamard manifolds
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
- Some remarks on proximal point algorithm in scalar and vectorial cases
- On the extension of Dai-Liao conjugate gradient method for vector optimization
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- Proximal Methods in Vector Optimization
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- Conditional gradient method for vector optimization
- On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds
- A proximal point algorithm with quasi-distance in multi-objective optimization
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- An interior proximal method with proximal distances for quasimonotone equilibrium problems
- Inertial forward–backward methods for solving vector optimization problems
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- A strongly convergent proximal point method for vector optimization
- Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
This page was built for publication: An interior proximal method in vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635150)
