On the public citation graph
Scalarization of vector optimization problems
0 signed · 68 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.1007/978-3-7091-2822-0_4openalex-snapshot
A Unified Approach for Scalar and Vector Optimization
inferredcites →https://doi.org/10.1007/bf00932614openalex-snapshot
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
inferredcites →https://doi.org/10.1007/bf00933970openalex-snapshot
Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives
inferredcites →https://doi.org/10.1007/bf00934564openalex-snapshot
Scalarizing vector optimization problems
inferredcites →https://doi.org/10.1007/bf02592221openalex-snapshot
Scalarization in vector optimization
inferredcites →https://doi.org/10.1016/0022-247x(79)90128-8openalex-snapshot
Stability in multicriteria optimization
inferredcites →https://doi.org/10.1016/0022-247x(85)90225-2openalex-snapshot
Images of connected sets by semicontinuous multifunctions
inferredcites →https://doi.org/10.1016/0022-247x(87)90264-2openalex-snapshot
Connectedness of the efficient point sets in quasiconcave vector maximization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-0348-8802-8_11openalex-snapshot
Multiobjective Optimal Control Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_1openalex-snapshot
Variable Ordering Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_10openalex-snapshot
Outlook and Further Application Areas
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_2openalex-snapshot
Optimality Concepts and Their Characterization
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_6openalex-snapshot
Scalarizations for Variable Orderings Given by Bishop-Phelps Cones
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_7openalex-snapshot
Optimality Conditions for Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/978-981-16-1819-2_6openalex-snapshot
Set Order Relations, Set Optimization, and Ekeland’s Variational Principle
inferred← citeshttps://doi.org/10.1007/978-981-97-8907-8_6openalex-snapshot
Scalarization for Set Optimization in Vector Spaces
inferred← citeshttps://doi.org/10.1007/s00186-022-00787-9openalex-snapshot
Approximations for Pareto and Proper Pareto solutions and their KKT conditions
inferred← citeshttps://doi.org/10.1007/s10107-006-0071-7openalex-snapshot
On the choice of parameters for the weighting method in vector optimization
inferred← citeshttps://doi.org/10.1007/s10107-006-0075-3openalex-snapshot
On some properties and an application of the logarithmic barrier method
inferred← citeshttps://doi.org/10.1007/s10589-012-9501-zopenalex-snapshot
Inexact projected gradient method for vector optimization
inferred← citeshttps://doi.org/10.1007/s10898-006-9018-zopenalex-snapshot
A New Duality Approach to Solving Concave Vector Maximization Problems
inferred← citeshttps://doi.org/10.1007/s10898-007-9263-9openalex-snapshot
Generating the weakly efficient set of nonconvex multiobjective problems
inferred← citeshttps://doi.org/10.1007/s10898-010-9550-8openalex-snapshot
Scalarization and pointwise well-posedness in vector optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-014-0265-0openalex-snapshot
Scalarization and pointwise well-posedness for set optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-019-00802-0openalex-snapshot
Nonmonotone line searches for unconstrained multiobjective optimization problems
inferred← citeshttps://doi.org/10.1007/s10957-012-0106-6openalex-snapshot
Stability and Scalarization of Weak Efficient, Efficient and Henig Proper Efficient Sets Using Generalized Quasiconvexities
inferred← citeshttps://doi.org/10.1007/s10957-013-0300-1openalex-snapshot
A Subgradient-Like Algorithm for Solving Vector Convex Inequalities
inferred← citeshttps://doi.org/10.1007/s10957-013-0308-6openalex-snapshot
A Steepest Descent-Like Method for Variable Order Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-013-0429-yopenalex-snapshot
Optimal Exploitation of Nonrenewable Resources
inferred← citeshttps://doi.org/10.1007/s10957-014-0686-4openalex-snapshot
Stability and Scalarization in Vector Optimization Using Improvement Sets
inferred← citeshttps://doi.org/10.1007/s11081-020-09579-8openalex-snapshot
On inexact projected gradient methods for solving variable vector optimization problems
inferred← citeshttps://doi.org/10.1007/s11117-012-0201-9openalex-snapshot
Nonsmooth multiobjective programming: strong Kuhn–Tucker conditions
inferred← citeshttps://doi.org/10.1007/s11766-026-4981-2openalex-snapshot
Optimality analysis for nonsmooth vector equilibrium problems with constraints via generalized subdifferentials
inferred← citeshttps://doi.org/10.1007/s12190-020-01322-xopenalex-snapshot
On q-Newton’s method for unconstrained multiobjective optimization problems
inferred← citeshttps://doi.org/10.1007/s43069-025-00484-3openalex-snapshot
A New Hybrid Conjugate Gradient Method Based on a Convex Combination for Multiobjective Optimization
inferred← citeshttps://doi.org/10.1016/0362-546x(90)90057-nopenalex-snapshot
Contractibility of efficient point sets in normed spaces
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.06.016openalex-snapshot
A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
inferred← citeshttps://doi.org/10.1016/j.energy.2026.141470openalex-snapshot
Probabilistic Safety Margin analysis method for SBLOCA in nuclear power plants based on a Multi-Level Hybrid Efficient Solution Strategy
inferred← citeshttps://doi.org/10.1016/j.fraope.2025.100231openalex-snapshot
Some descent Dai-Liao-type conjugate gradient methods for vector optimization
inferred← citeshttps://doi.org/10.1016/j.rico.2023.100348openalex-snapshot
Efficient hybrid conjugate gradient techniques for vector optimization
inferred← citeshttps://doi.org/10.1023/a:1022654107386openalex-snapshot
Cones Admitting Strictly Positive Functionals and Scalarization of Some Vector Optimization Problems
inferred← citeshttps://doi.org/10.1080/00036811.2013.809068openalex-snapshot
On quadratic scalarization of vector optimization problems in Banach spaces
inferred← citeshttps://doi.org/10.1080/00036811.2018.1441992openalex-snapshot
Efficient solutions in generalized linear vector optimization
inferred← citeshttps://doi.org/10.1080/02331934.2010.522710openalex-snapshot
On the convergence of the projected gradient method for vector optimization
inferred← citeshttps://doi.org/10.1080/02331934.2019.1576667openalex-snapshot
A barrier-type method for multiobjective optimization
inferred← citeshttps://doi.org/10.1080/02331934.2024.2399803openalex-snapshot
On the Dai–Liao conjugate gradient method for vector optimization
inferred← citeshttps://doi.org/10.1080/10556788.2021.1880579openalex-snapshot
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
inferred← citeshttps://doi.org/10.1081/nfa-100108312openalex-snapshot
ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
inferred← citeshttps://doi.org/10.1137/040603097openalex-snapshot
Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
inferred← citeshttps://doi.org/10.1137/09075648xopenalex-snapshot
Finding Efficient Solutions by Free Disposal Outer Approximation
inferred← citeshttps://doi.org/10.1137/120866415openalex-snapshot
A Subgradient Method for Vector Optimization Problems
inferred← citeshttps://doi.org/10.11650/tjm/180603openalex-snapshot
An Approach to $\epsilon$-duality Theorems for Nonconvex Semi-infinite Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.11650/tjm/190101openalex-snapshot
Finding Efficient Solutions for Multicriteria Optimization Problems with SOS-convex Polynomials
inferred← citeshttps://doi.org/10.12732/ijpam.v102i3.13openalex-snapshot
A SUBGRADIENT METHODS FOR NON-SMOOTH VECTOR OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.1371/journal.pone.0302441openalex-snapshot
Spectral-like conjugate gradient methods with sufficient descent property for vector optimization
inferred← citeshttps://doi.org/10.15807/jorsj.67.1openalex-snapshot
MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
inferred← citeshttps://doi.org/10.23952/jnva.6.2022.6.02openalex-snapshot
A steepest descent-like method for vector optimization problems with variable domination structure
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01710openalex-snapshot
An inexact strategy for the projected gradient algorithm in vector optimization problems on variable ordered spaces
inferred← citeshttps://doi.org/10.68381/jca19029openalex-snapshot
A Multiplier Rule for Stable Problems in 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.