Characterizations of the solution set for non-essentially quasiconvex programming
type: Item
instance of: scholarly article
title: Characterizations of the solution set for non-essentially quasiconvex programming
zbMATH Open document ID: 1454.90065
author: Satoshi Suzuki
author: Daishi Kuroiwa
published in: Optimization Letters
publication date: 2017-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6819063
zbMATH Keywords: quasiconvex programming
zbMATH Keywords: solution set
zbMATH Keywords: subdifferential
zbMATH Keywords: optimality condition
MaRDI profile type: Publication
full work available at URL: s11590-016-1084-7
OpenAlex ID: W2522923325
cites work: Generalized concavity
cites work: Characterization of solution sets of convex programs
cites work: Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons
cites work: An appropriate subdifferential for quasiconvex functions
cites work: Strong and total Lagrange dualities for quasiconvex programming
cites work: Q4401741
cites work: Necessary and sufficient constraint qualification for surrogate duality
cites work: Inexact subgradient methods for quasi-convex optimization problems
cites work: First order characterizations of pseudoconvex functions
cites work: Q4443700
cites work: Characterizations of pseudoconvex functions and semistrictly quasiconvex ones
cites work: Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
cites work: Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
cites work: Optimality Conditions for Quasiconvex Programs
cites work: A simple characterization of solutions sets of convex programs
cites work: Q3670037
cites work: Q3332778
cites work: Quasiconvex duality theory by generalized conjugation methods
cites work: Q4704617
cites work: Inf-convolution, sous-additivite, convexite des fonctions numériques
cites work: What is quasiconvex analysis?
cites work: Characterization of solution sets of quasiconvex programs
cites work: On Quasi-Convex Duality
cites work: Lower subdifferentiable functions and their minimization by cutting planes
cites work: A new approach to characterize the solution set of a pseudoconvex programming problem
cites work: Optimality conditions and the basic constraint qualification for quasiconvex programming
cites work: Subdifferential calculus for a quasiconvex function with generator
cites work: Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
cites work: Some constraint qualifications for quasiconvex vector-valued systems
cites work: Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
cites work: Q4640015
cites work: Characterizations of the solution sets of convex programs and variational inequality problems
cites work: On characterizing the solution sets of pseudoinvex extremum problems
cites work: Characterizations of the solution set for a class of nonsmooth optimization problems
DOI: 10.1007/S11590-016-1084-7
description: scientific article; zbMATH DE number 6819063