A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems (Q316185): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-016-9840-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2333923918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split Feasibility and Fixed Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\eta\)-approximation method in nonlinear vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal point algorithm revisit on the alternating direction method of multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extragradient method for solving split feasibility and fixed point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective optimization problems with modified objective functions and cone constraints and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and optimality conditions for approximate solutions to vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Navigating in a Graph by Aid of Its Spanning Tree Metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A customized proximal point algorithm for convex minimization with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach for constrained extremum problems: image space analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the <i>CQ</i> algorithm for the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria optimization in engineering and in the sciences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxed CQ algorithm solving the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite projection algorithms for the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several solution methods for the split feasibility problem / rank
 
Normal rank

Latest revision as of 15:31, 12 July 2024

scientific article
Language Label Description Also known as
English
A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
scientific article

    Statements

    A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 September 2016
    0 references
    multiobjective optimization with cone constraints
    0 references
    mixed variational inequalities
    0 references
    split feasibility problems
    0 references
    proximal point algorithm
    0 references
    auxiliary principle
    0 references
    decomposition method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers