Convex composite multi-objective nonsmooth programming
From MaRDI portal
Publication:687035
DOI10.1007/BF01581251zbMath0789.90068OpenAlexW1995340188MaRDI QIDQ687035
Vaithilingam Jeyakumar, Xiao Qi Yang
Publication date: 20 December 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581251
Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Fréchet and Gateaux differentiability in optimization (49J50) Programming in abstract spaces (90C48)
Related Items
Optimality and duality in nonsmooth composite vector optimization and applications, Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems, Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization, On characterizing the solution sets of pseudolinear programs, Convex composite minimization with \(C^{1,1}\) functions, Optimality conditions in quasidifferentiable vector optimization, First and second-order optimality conditions for convex composite multiobjective optimization, Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities, Affine variational inequalities on normed spaces, A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization, Optimality conditions for a class of composite multiobjective nonsmooth optimization problems, On characterizing solution set of non-differentiable η-pseudolinear extremum problem, A note on characterizing solution set of nonsmooth pseudoinvex optimization problem, Asymptotic analysis in convex composite multiobjective optimization problems, Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions, Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions., Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency, Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions, Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions, Optimality conditions and duality in nonsmooth multiobjective optimization problems, Conjugate duality for multiobjective composed optimization problems, On the relations between different duals assigned to composed optimization problems, Nonconvex composite multiobjective nonsmooth fractional programming, Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems, Metric subregularity for composite-convex generalized equations in Banach spaces, Necessary optimality conditions in nondifferentiable vector optimization, Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets, Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs, Second-order global optimality conditions for optimization problems, Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming, Characterizations of solution sets of convex vector minimization problems, The stable Farkas lemma for composite convex functions in infinite dimensional spaces, Characterization of solution sets of convex optimization problems in Riemannian manifolds, On characterizing the solution sets of pseudoinvex extremum problems, Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity, Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers, Characterization of efficient solutions of multi-objective \(E\)-convex programming problems, Second-order global optimality conditions for convex composite optimization, Multiple objective fractional programming involving semilocally type I-preinvex and related functions, Higher-order generalized tangent epiderivatives and applications to set-valued optimization, A new approach to strong duality for composite vector optimization problems, Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity, Suboptimal policy determination for large-scale Markov decision processes. I: Description and bounds, Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions, Generalized convex functions and vector variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General constraint qualifications in nondifferentiable programming
- Multiobjective programming and penalty functions
- Theory of multiobjective optimization
- A simple characterization of solutions sets of convex programs
- On sufficiency of the Kuhn-Tucker conditions
- Zero duality gaps in infinite-dimensional programming
- Infinite-dimensional convex programming with applications to constrained approximation
- Multicriteria optimization in engineering and in the sciences
- Proper efficiency and the theory of vector maximization
- Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
- Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
- Pseudolinearity and efficiency
- Scalarization in vector optimization
- Vector and Parametric Programming
- Optimization and nonsmooth analysis
- Convexlike alternative theorems and mathematical programming
- Descent methods for composite nondifferentiable optimization problems
- Generalized Quasiconvex Mappings and Vector Optimization
- On optimality conditions in nonsmooth inequality constrained minimization
- Second order necessary and sufficient conditions for convex composite NDO
- Generalised convexity and duality in multiple objective programming
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- A model algorithm for composite nondifferentiable optimization problems
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- Composite Nonsmooth Programming with Gâteaux Differentiability