Convex composite multi-objective nonsmooth programming
From MaRDI portal
Publication:687035
DOI10.1007/BF01581251zbMATH Open0789.90068OpenAlexW1995340188MaRDI QIDQ687035FDOQ687035
Authors: V. 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
Recommendations
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
- Nonconvex composite multiobjective nonsmooth fractional programming
- scientific article; zbMATH DE number 1960958
- Optimality and duality in nonsmooth composite vector optimization and applications
- Optimality conditions of nonsmooth composite generalized invex multiobjective programming
Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Fréchet and Gateaux differentiability in optimization (49J50)
Cites Work
- Title not available (Why is that?)
- Theory of multiobjective optimization
- Optimization and nonsmooth analysis
- Multiobjective programming and penalty functions
- On sufficiency of the Kuhn-Tucker conditions
- Proper efficiency and the theory of vector maximization
- Pseudolinearity and efficiency
- Convexlike alternative theorems and mathematical programming
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- Descent methods for composite nondifferentiable optimization problems
- Title not available (Why is that?)
- Multicriteria optimization in engineering and in the sciences
- Scalarization in vector optimization
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- A simple characterization of solutions sets of convex programs
- Title not available (Why is that?)
- Infinite-dimensional convex programming with applications to constrained approximation
- Title not available (Why is that?)
- Zero duality gaps in infinite-dimensional programming
- Title not available (Why is that?)
- Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
- On optimality conditions in nonsmooth inequality constrained minimization
- Composite Nonsmooth Programming with Gâteaux Differentiability
- Generalised convexity and duality in multiple objective programming
- Title not available (Why is that?)
- Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
- A model algorithm for composite nondifferentiable optimization problems
- Second order necessary and sufficient conditions for convex composite NDO
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vector and Parametric Programming
- Generalized Quasiconvex Mappings and Vector Optimization
- General constraint qualifications in nondifferentiable programming
Cited In (49)
- A new approach to strong duality for composite vector optimization problems
- Convex composite minimization with \(C^{1,1}\) functions
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- Optimality and duality in nonsmooth composite vector optimization and applications
- Necessary optimality conditions in nondifferentiable vector optimization
- Optimality conditions in quasidifferentiable vector optimization
- Perturbing convex multiobjecttve programs
- Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity
- Conjugate duality for multiobjective composed optimization problems
- On the relations between different duals assigned to composed optimization problems
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing the solution sets of pseudoinvex extremum problems
- Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions
- Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
- Generalized convex functions and vector variational inequalities
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity
- Higher-order generalized tangent epiderivatives and applications to set-valued optimization
- Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions
- Affine variational inequalities on normed spaces
- Nonconvex composite multiobjective nonsmooth fractional programming
- Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
- Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Second-order global optimality conditions for optimization problems
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
- Suboptimal policy determination for large-scale Markov decision processes. I: Description and bounds
- Characterizations of solution sets of convex vector minimization problems
- Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
- Second-order global optimality conditions for convex composite optimization
- Multiple objective fractional programming involving semilocally type I-preinvex and related functions
- On characterizing solution set of non-differentiable \(\eta \)-pseudolinear extremum problem
- Asymptotic analysis in convex composite multiobjective optimization problems
- Metric subregularity for composite-convex generalized equations in Banach spaces
- Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
- Composite Nonsmooth Programming with Gâteaux Differentiability
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
- First and second-order optimality conditions for convex composite multiobjective optimization
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
- A complementarity constraint formulation of convex multiobjective optimization problems
- Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
- Composite convex programs
- Optimality conditions for a class of composite multiobjective nonsmooth optimization problems
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- Characterization of solution sets of convex optimization problems in Riemannian manifolds
- A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization
- A note on characterizing solution set of nonsmooth pseudoinvex optimization problem
- On characterizing the solution sets of pseudolinear programs
This page was built for publication: Convex composite multi-objective nonsmooth programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687035)
