Characterizations of the solution set for tangentially convex optimization problems

DOI10.1007/s11590-022-01911-8zbMath1518.90072OpenAlexW4289516638MaRDI QIDQ6043119

M. Beni-Asad, Hossein Mohebi

Publication date: 4 May 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-022-01911-8

zbMATH Keywords

optimality conditionsnonconvex programmingsolution setnonsmooth programmingGreenberg-Pierskalla subdifferentialstangential subdifferentialstangentially convex function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
• Necessary and sufficient constraint qualification for surrogate duality
• Optimality conditions and the basic constraint qualification for quasiconvex programming
• Subdifferential calculus for a quasiconvex function with generator
• Lower subdifferentiable functions and their minimization by cutting planes
• 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
• Characterizing best approximation from a convex set without convex representation
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Some constraint qualifications for quasiconvex vector-valued systems
• Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
• Optimality conditions for nonconvex problems over nearly convex feasible sets
• Optimality conditions for convex problems on intersections of non necessarily convex sets
• Strong and total Lagrange dualities for quasiconvex programming
• Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
• Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
• Necessary and sufficient KKT optimality conditions in non-convex optimization
• Characterizations of solution sets of differentiable quasiconvex programming problems
• Characterizations of solution sets of convex vector minimization problems
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• Characterization of solution sets of convex programs
• An Appropriate Subdifferential for Quasiconvex Functions
• Introduction to Nonsmooth Optimization
• Optimality Conditions for Quasiconvex Programs
• Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
• Quasiconvex duality theory by generalized conjugation methods
• An introduction to the theory of nonsmooth optimization
• What is quasiconvex analysis?
• Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
• Optimality Conditions for Nonconvex Constrained Optimization Problems
• On Quasi-Convex Duality

This page was built for publication: Characterizations of the solution set for tangentially convex optimization problems