Characterizations of solution sets of differentiable quasiconvex programming problems

DOI10.1007/s10957-018-1379-1zbMath1414.90286arXiv1805.03847OpenAlexW3106485626WikidataQ129399273 ScholiaQ129399273MaRDI QIDQ2420773

Vsevolod I. Ivanov

Publication date: 7 June 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.03847

zbMATH Keywords

quasiconvex functionpseudoconvex functionKKT conditionscharacterizations of the solution setquasiconvex program

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions of several variables, generalizations (26B25)

Related Items (8)

An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials ⋮ On characterizations of solution sets of interval-valued quasiconvex programming problems ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Characterization of radially lower semicontinuous pseudoconvex functions ⋮ Second-order optimality conditions and Lagrange multiplier characterizations of the solution set in quasiconvex programming ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations of the solution sets of pseudoinvex programs and variational inequalities
• Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
• A new approach to characterize the solution set of a pseudoconvex programming problem
• Optimization and variational inequalities with pseudoconvex functions
• The convexity of the solution set of a pseudoconvex inequality
• On characterizing the solution sets of pseudoinvex extremum problems
• Characterizations of optimal solution sets of convex infinite programs
• A simple characterization of solutions sets of convex programs
• Characterization of solution sets of quasiconvex programs
• Characterizations of the solution set for non-essentially quasiconvex programming
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• On characterizing the solution sets of pseudolinear programs
• Characterizations of the solution set for a class of nonsmooth optimization problems
• Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
• Characterizations of pseudoconvex functions and semistrictly quasiconvex ones
• Characterizations of solution sets of convex vector minimization problems
• Characterization of solution sets of convex programs
• Higher order invex functions and higher order pseudoinvex ones
• Generalized Concavity
• Quasi-Concave Programming
• Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
• Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
• Quasiconvex duality theory by generalized conjugation methods
• A note on characterization of solution sets to pseudolinear programming problems

This page was built for publication: Characterizations of solution sets of differentiable quasiconvex programming problems