Hai Sun, Jiawei Chen, Zhongping Wan
Abstract
In this paper, the authors study several existing notions of well-posedness for vector K-quasiconnected optimization problems. By using the relationship of L(B)-well-posedness and well-posed in the generalized sense, under some compactness assumption, K-quasiconnected problems are well-posed.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, the authors study several existing notions of well-posedness for vector K-quasiconnected optimization problems. By using the relationship of L(B)-well-posedness and well-posed in the generalized sense, under some compactness assumption, K-quasiconnected problems are well-posed.
Key concepts: Compact space, Optimization problem, Constrained optimization problem, Vector optimization, Set (abstract data type), Mathematics, Mathematical optimization, Computer science