Characterizations of the solution set for tangentially convex optimization problems
From MaRDI portal
Publication:6043119
Recommendations
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Characterizations of the solution set for non-essentially quasiconvex programming
Cites work
- A simple characterization of solutions sets of convex programs
- An appropriate subdifferential for quasiconvex functions
- An introduction to the theory of nonsmooth optimization
- Characterization of solution sets of convex programs
- Characterization of solution sets of quasiconvex programs
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizations of the solution set for non-essentially quasiconvex programming
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Characterizing best approximation from a convex set without convex representation
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- scientific article; zbMATH DE number 3865001 (Why is no real title available?)
- scientific article; zbMATH DE number 3824556 (Why is no real title available?)
- scientific article; zbMATH DE number 3921337 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3336546 (Why is no real title available?)
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Introduction to nonsmooth optimization. Theory, practice and software
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Lower subdifferentiable functions and their minimization by cutting planes
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Necessary and sufficient constraint qualification for surrogate duality
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- On Quasi-Convex Duality
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Optimality conditions for convex problems on intersections of non necessarily convex sets
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- Optimality conditions for nonconvex problems over nearly convex feasible sets
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimality Conditions for Quasiconvex Programs
- Quasiconvex duality theory by generalized conjugation methods
- Some constraint qualifications for quasiconvex vector-valued systems
- Strong and total Lagrange dualities for quasiconvex programming
- Subdifferential calculus for a quasiconvex function with generator
- What is quasiconvex analysis?
Cited in
(7)- Characterizations of the solution set for non-essentially quasiconvex programming
- Characterizing the solution set of convex optimization problems without convexity of constraints
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- scientific article; zbMATH DE number 5492356 (Why is no real title available?)
- Local optimality conditions and local saddle point theorems for nonconvex robust programming
This page was built for publication: Characterizations of the solution set for tangentially convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043119)
