Asymptotic analysis in convex composite multiobjective optimization problems
From MaRDI portal
Publication:1945516
DOI10.1007/s10898-012-0032-zzbMath1290.90066OpenAlexW2036224565MaRDI QIDQ1945516
Publication date: 8 April 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-0032-z
compactnessasymptotic analysisnonemptinessweak Pareto optimal solutionproximal-type methodconvex composite multiobjective optimization
Convex programming (90C25) Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)
Related Items (3)
Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ Logarithmic quasi-distance proximal point scalarization method for multi-objective programming ⋮ Asymptotic analysis for proximal-type methods in vector variational inequality problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized viscosity approximation methods in multiobjective optimization problems
- Convex composite multi-objective nonsmooth programming
- Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces
- Theory of multiobjective optimization
- Second-order global optimality conditions for convex composite optimization
- Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity
- First and second-order optimality conditions for convex composite multiobjective optimization
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Ideal, weakly efficient solutions for vector optimization problems
- Convex composite non-Lipschitz programming
- Convex composite minimization with \(C^{1,1}\) functions
- A Gauss-Newton method for convex composite optimization
- Conjugate duality for multiobjective composed optimization problems
- Vector optimization. Set-valued and variational analysis.
- Generalized proximal point algorithms for multiobjective optimization problems
- Scalarization in vector optimization
- Local properties of algorithms for minimizing nonsmooth composite functions
- Composite Nonsmooth Programming with Gâteaux Differentiability
- An Existence Theorem in Vector Optimization
- Proximal Methods in Vector Optimization
- Convex Analysis
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
This page was built for publication: Asymptotic analysis in convex composite multiobjective optimization problems
