On the public citation graph
Convex composite multi-objective nonsmooth programming
0 signed · 110 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9781118723203openalex-snapshot
Practical Methods of Optimization
inferredcites →https://doi.org/10.1007/978-1-4899-3734-6openalex-snapshot
Multicriteria Optimization in Engineering and in the Sciences
inferredcites →https://doi.org/10.1007/978-1-4899-3734-6_3openalex-snapshot
Applications of Multicriteria Optimization in Approximation Theory
inferredcites →https://doi.org/10.1007/978-1-4899-3734-6_8openalex-snapshot
Multicriteria Optimization Methods for Design of Aircraft Control Systems
inferredcites →https://doi.org/10.1007/978-3-7091-2822-0_3openalex-snapshot
Scalarization in Multi Objective Optimization
inferredcites →https://doi.org/10.1007/978-94-009-5796-1openalex-snapshot
Mathematical Programming and Control Theory
inferredcites →https://doi.org/10.1007/bf00935007openalex-snapshot
Multiobjective programming and penalty functions
inferredcites →https://doi.org/10.1007/bf00939737openalex-snapshot
Zero duality gaps in infinite-dimensional programming
inferredcites →https://doi.org/10.1007/bf00940493openalex-snapshot
Infinite-dimensional convex programming with applications to constrained approximation
inferredcites →https://doi.org/10.1007/bf01580871openalex-snapshot
General constraint qualifications in nondifferentiable programming
inferredcites →https://doi.org/10.1007/bf01584377openalex-snapshot
Descent methods for composite nondifferentiable optimization problems
inferredcites →https://doi.org/10.1007/bf01585095openalex-snapshot
Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
inferredcites →https://doi.org/10.1007/bf02592016openalex-snapshot
Second order necessary and sufficient conditions for convex composite NDO
inferredcites →https://doi.org/10.1007/bf02592221openalex-snapshot
Scalarization in vector optimization
inferredcites →https://doi.org/10.1007/bfb0120959openalex-snapshot
A model algorithm for composite nondifferentiable optimization problems
inferredcites →https://doi.org/10.1016/0022-247x(68)90201-1openalex-snapshot
Proper efficiency and the theory of vector maximization
inferredcites →https://doi.org/10.1016/0022-247x(81)90123-2openalex-snapshot
On sufficiency of the Kuhn-Tucker conditions
inferredcites →https://doi.org/10.1016/0167-6377(88)90047-8openalex-snapshot
A simple characterization of solution sets of convex programs
inferredcites →https://doi.org/10.1016/0377-2217(89)90047-7openalex-snapshot
Theory of vector optimization
inferredcites →https://doi.org/10.1016/0378-4754(88)90129-2openalex-snapshot
Practical methods of optimization
inferredcites →https://doi.org/10.1016/s0076-5392(09)x6017-0openalex-snapshot
Theory of Multiobjective Optimization
inferredcites →https://doi.org/10.1017/s000497270000277xopenalex-snapshot
Generalised convexity and duality in multiple objective programming
inferredcites →https://doi.org/10.1057/jors.1985.69openalex-snapshot
Vector and Parametric Programming
inferredcites →https://doi.org/10.1080/01630568708816246openalex-snapshot
On optimality conditions in nonsmooth inequality constrained minimization
inferredcites →https://doi.org/10.1080/02331938508843061openalex-snapshot
Convexlike alternative theorems and mathematical programming
inferredcites →https://doi.org/10.1090/s0002-9947-1988-0936806-9openalex-snapshot
First- and Second-Order Epi-Differentiability in Nonlinear Programming
inferredcites →https://doi.org/10.1137/0317020openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
inferredcites →https://doi.org/10.1137/0324017openalex-snapshot
Generalized Quasiconvex Mappings and Vector Optimization
inferredcites →https://doi.org/10.1137/0801004openalex-snapshot
Composite Nonsmooth Programming with Gâteaux Differentiability
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/opre.32.1.216openalex-snapshot
Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jmaa.1999.6409openalex-snapshot
Composite Nonsmooth Multiobjective Programs with V-ρ-Invexity
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_66openalex-snapshot
Composite Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_82openalex-snapshot
Composite Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4939-3094-4_18openalex-snapshot
Continuous Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_82-1openalex-snapshot
Composite Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-981-97-8907-8_2openalex-snapshot
Solution Concepts in Vector Optimization – An Overview
inferred← citeshttps://doi.org/10.1007/bf00940559openalex-snapshot
Generalized convex functions and vector variational inequalities
inferred← citeshttps://doi.org/10.1007/bf01580087openalex-snapshot
Second-order global optimality conditions for convex composite optimization
inferred← citeshttps://doi.org/10.1007/bf02192142openalex-snapshot
On characterizing the solution sets of pseudolinear programs
inferred← citeshttps://doi.org/10.1007/bf02192162openalex-snapshot
Convex composite minimization withC 1,1 functions
inferred← citeshttps://doi.org/10.1007/s00013-019-01382-xopenalex-snapshot
Characterization of solution sets of convex optimization problems in Riemannian manifolds
inferred← citeshttps://doi.org/10.1007/s00186-007-0169-6openalex-snapshot
On the relations between different duals assigned to composed optimization problems
inferred← citeshttps://doi.org/10.1007/s00186-007-0202-9openalex-snapshot
Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions
inferred← citeshttps://doi.org/10.1007/s10107-009-0277-6openalex-snapshot
Strong KKT conditions and weak sharp solutions in convex-composite optimization
inferred← citeshttps://doi.org/10.1007/s101070100274openalex-snapshot
Convex composite non-Lipschitz programming
inferred← citeshttps://doi.org/10.1007/s10107980013aopenalex-snapshot
Dual conditions characterizing optimality for convex multi-objective programs
inferred← citeshttps://doi.org/10.1007/s10255-015-0493-1openalex-snapshot
The Stable Farkas Lemma for composite convex functions in infinite dimensional spaces
inferred← citeshttps://doi.org/10.1007/s10474-007-4273-0openalex-snapshot
Conjugate duality for multiobjective composed optimization problems
inferred← citeshttps://doi.org/10.1007/s10479-014-1552-3openalex-snapshot
Optimality conditions and duality in nonsmooth multiobjective optimization problems
inferred← citeshttps://doi.org/10.1007/s10479-019-03349-1openalex-snapshot
Optimality and duality in nonsmooth composite vector optimization and applications
inferred← citeshttps://doi.org/10.1007/s10898-004-8268-xopenalex-snapshot
Second-Order Global Optimality Conditions for Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10898-012-0032-zopenalex-snapshot
Asymptotic analysis in convex composite multiobjective optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-012-9957-5openalex-snapshot
Optimality conditions for a class of composite multiobjective nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/s10957-008-9470-7openalex-snapshot
On Characterizing the Solution Sets of Pseudoinvex Extremum Problems
inferred← citeshttps://doi.org/10.1007/s10957-009-9589-1openalex-snapshot
Boundedness and Nonemptiness of the Efficient Solution Sets in Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/s10957-012-0243-yopenalex-snapshot
Optimality Conditions and Characterizations of the Solution Sets in Generalized Convex Problems and Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s10957-013-0313-9openalex-snapshot
Lagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-016-0987-xopenalex-snapshot
Optimality Conditions in Quasidifferentiable Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10957-018-1296-3openalex-snapshot
Affine Variational Inequalities on Normed Spaces
inferred← citeshttps://doi.org/10.1007/s11117-022-00953-7openalex-snapshot
Higher-order generalized tangent epiderivatives and applications to set-valued optimization
inferred← citeshttps://doi.org/10.1007/s11228-006-0023-7openalex-snapshot
Sharp Minima for Multiobjective Optimization in Banach Spaces
inferred← citeshttps://doi.org/10.1007/s11590-011-0399-7openalex-snapshot
A note on characterizing solution set of nonsmooth pseudoinvex optimization problem
inferred← citeshttps://doi.org/10.1016/0362-546x(94)00122-xopenalex-snapshot
A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.05.007openalex-snapshot
Characterizations of solution sets of convex vector minimization problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.02.032openalex-snapshot
Multiple objective fractional programming involving semilocally type I-preinvex and related functions
inferred← citeshttps://doi.org/10.1016/j.na.2010.03.032openalex-snapshot
Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
inferred← citeshttps://doi.org/10.1016/j.na.2011.02.008openalex-snapshot
Metric subregularity for composite-convex generalized equations in Banach spaces
inferred← citeshttps://doi.org/10.1016/j.na.2011.12.009openalex-snapshot
Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under -invexity
inferred← citeshttps://doi.org/10.1016/s0022-247x(02)00460-2openalex-snapshot
Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions
inferred← citeshttps://doi.org/10.1016/s0096-3003(03)00526-5openalex-snapshot
Characterization of efficient solutions of multi-objective E-convex programming problems
inferred← citeshttps://doi.org/10.1016/s0362-546x(98)00058-3openalex-snapshot
Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions
inferred← citeshttps://doi.org/10.1017/s0334270000010973openalex-snapshot
Necessary optimality conditions for bicriterion discrete optimal control problems
inferred← citeshttps://doi.org/10.1023/a:1022503820909openalex-snapshot
Convergence Analysis of a Class of Nonlinear Penalization Methods for Constrained Optimization via First-Order Necessary Optimality Conditions
inferred← citeshttps://doi.org/10.1023/a:1022695714596openalex-snapshot
First and Second-Order Optimality Conditions for Convex Composite Multiobjective Optimization
inferred← citeshttps://doi.org/10.1023/b:jota.0000043992.38554.c8openalex-snapshot
Lagrange Multiplier Conditions Characterizing the Optimal Solution Sets of Cone-Constrained Convex Programs
inferred← citeshttps://doi.org/10.1051/smdo/2020011openalex-snapshot
Optimality and duality for nonsmooth semi-infinite E-convex multi-objective programming with support functions
inferred← citeshttps://doi.org/10.1080/01630563.2018.1431927openalex-snapshot
Convexity of the Solution Set of a Pseudoconvex Inequality in Riemannian Manifolds
inferred← citeshttps://doi.org/10.1080/02331930108844561openalex-snapshot
Necessary optimality conditions in nondifferentiable vector optimization
inferred← citeshttps://doi.org/10.1080/02331930600662849openalex-snapshot
Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
inferred← citeshttps://doi.org/10.1080/02331930701763272openalex-snapshot
Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
inferred← citeshttps://doi.org/10.1080/02331934.2010.505653openalex-snapshot
On characterizing solution set of non-differentiable η-pseudolinear extremum problem
inferred← citeshttps://doi.org/10.1080/02331934.2020.1745796openalex-snapshot
A new approach to strong duality for composite vector optimization problems
inferred← citeshttps://doi.org/10.1080/02331939208843851openalex-snapshot
Generalized second-order directional derivatives and optimization with C 1,1 functions
inferred← citeshttps://doi.org/10.1080/02331939508844093openalex-snapshot
Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
inferred← citeshttps://doi.org/10.1080/02331939608844179openalex-snapshot
Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
inferred← citeshttps://doi.org/10.1080/02331939608844241openalex-snapshot
Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
inferred← citeshttps://doi.org/10.1080/02522667.2020.1748277openalex-snapshot
Nonsmooth semi-infinite E-convex multi-objective programming with support functions
inferred← citeshttps://doi.org/10.1080/09720510.1998.10700977openalex-snapshot
Proper efficiency principles and duality models for a class of continuous-time multiobjective fractional programming problems with operator constraints
inferred← citeshttps://doi.org/10.1080/09720510.2001.10701038openalex-snapshot
Quasi and strictly quasiE-convex functions
inferred← citeshttps://doi.org/10.1137/100806199openalex-snapshot
Perturbation Analysis of Error Bounds for Quasi-subsmooth Inequalities and Semi-infinite Constraint Systems
inferred← citeshttps://doi.org/10.1137/s0363012996311745openalex-snapshot
Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C 1 -Optimization
inferred← citeshttps://doi.org/10.1137/s1052623401384850openalex-snapshot
Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization
inferred← citeshttps://doi.org/10.1137/s1052623401396509openalex-snapshot
Sharp Variational Conditions for Convex Composite Nonsmooth Functions
inferred← citeshttps://doi.org/10.1155/s0161171201006317openalex-snapshot
Stability in E‐convex programming
inferred← citeshttps://doi.org/10.1186/1029-242x-2011-32openalex-snapshot
Characterizations of the solution sets of pseudoinvex programs and variational inequalities
inferred← citeshttps://doi.org/10.1186/1029-242x-2013-508openalex-snapshot
Nonconvex composite multiobjective nonsmooth fractional programming
inferred← citeshttps://doi.org/10.1201/b15244-11openalex-snapshot
Elements of Variational Inequalities
inferred← citeshttps://doi.org/10.1201/b15244-14openalex-snapshot
Nonsmooth Generalized Variational Inequalities and Optimization Problems
inferred← citeshttps://doi.org/10.14736/kyb-2025-2-0221openalex-snapshot
Optimality conditions for an interval-valued vector problem
inferred← citeshttps://doi.org/10.2478/candc-2024-0014openalex-snapshot
Logarithmic E -convex multi-objective programming
inferred← citeshttps://doi.org/10.37193/cjm.2021.03.14openalex-snapshot
Approximate optimality and approximate duality in nonsmooth composite vector optimization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.