A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
From MaRDI portal
Publication:316185
DOI10.1007/s10589-016-9840-2zbMath1377.90083OpenAlexW2333923918MaRDI QIDQ316185
Yeong-Cheng Liou, Qamrul Hasan Ansari, Jen-Chih Yao, Jia-wei Chen
Publication date: 26 September 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9840-2
decomposition methodauxiliary principleproximal point algorithmmixed variational inequalitiessplit feasibility problemsmultiobjective optimization with cone constraints
Related Items (3)
A cooperative coevolution PSO technique for complex bilevel programming problems and application to watershed water trading decision making problems ⋮ Vector-valued separation functions and constrained vector optimization problems: optimality and saddle points ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A unified approach for constrained extremum problems: image space analysis
- Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Multiobjective optimization problems with modified objective functions and cone constraints and applications
- An extragradient method for solving split feasibility and fixed point problems
- Multicriteria optimization in engineering and in the sciences
- Composite projection algorithms for the split feasibility problem
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints
- A proximal point algorithm revisit on the alternating direction method of multipliers
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces
- An \(\eta\)-approximation method in nonlinear vector optimization
- A customized proximal point algorithm for convex minimization with linear constraints
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- Monotone Operators and the Proximal Point Algorithm
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
- Split Feasibility and Fixed Point Problems
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Convex Analysis
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- Navigating in a Graph by Aid of Its Spanning Tree Metric
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
