Characterization of solution sets of convex programs
From MaRDI portal
Publication:2640443
Let \(\bar S=\arg \min_{x\in S}f(x)\), where \(f: V\to \bar R\) is a proper convex function defined on \(V\), a real locally convex topological vector space, and \(S\) is a convex subset of \(V\). The main result in this paper states that the set \(\partial f(x)\cap -N(x| S)\), for \(x\in \bar S\), does not depend on \(x\). This generalizes a previous result of \textit{O. L. Mangasarian} [Oper. Res. Lett. 7, No. 1, 21--26 (1988; Zbl 0653.90055)], proving the independence of \(\partial f(x)\) on \(x\in \bar S\).
Recommendations
- A simple characterization of solutions sets of convex programs
- Characterizations of the solution sets of convex programs and variational inequality problems
- Characterizations of optimal solution sets of convex infinite programs
- scientific article; zbMATH DE number 2027845
- Characterizations of solution sets of convex vector minimization problems
Cites work
- A simple characterization of solutions sets of convex programs
- Characterization of solution sets of convex programs
- Finite perturbation of convex programs
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
Cited in
(63)- On characterizing the solution sets of pseudoinvex extremum problems
- Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces
- Characterizations of optimal solution sets of convex infinite programs
- A simple characterization of solutions sets of convex programs
- Finite termination of the proximal point algorithm
- Minimum principle sufficiency
- Modified proximal point algorithm for extended linear-quadratic programming
- Infinite-dimensional convex programming with applications to constrained approximation
- Characterization of solution sets of quasiconvex programs
- Characterizations of robust solution set of convex programs with uncertain data
- 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
- Generalized weak sharp minima in cone-constrained convex optimization with applications
- A note on characterizing solution set of nonsmooth pseudoinvex optimization problem
- Characterizations of the solution set for a class of nonsmooth optimization problems
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- Characterizing robust solution sets of convex programs under data uncertainty
- Optimality conditions and constraint qualifications for quasiconvex programming
- Characterization of solution sets of convex optimization problems in Riemannian manifolds
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Pseudomonotone operators: a survey of the theory and its applications
- Characterizations of pseudoconvex functions and semistrictly quasiconvex ones
- On alternative optimal solutions to quasimonotonic programming with linear constraints
- Characterizations of solution sets of convex vector minimization problems
- Characterization of solution sets of convex programs
- On characterizing solution set of non-differentiable -pseudolinear extremum problem
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
- 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
- scientific article; zbMATH DE number 1329072 (Why is no real title available?)
- Ergodic convergence in subgradient optimization
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- A note on characterization of solution sets to pseudolinear programming problems
- Finite termination of inexact proximal point algorithms in Hilbert spaces
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Characterizations of solution sets of cone-constrained convex programming problems
- scientific article; zbMATH DE number 7450966 (Why is no real title available?)
- scientific article; zbMATH DE number 7108800 (Why is no real title available?)
- 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
- The Geometry of Sparse Analysis Regularization
- On characterizations of solution sets of interval-valued quasiconvex programming problems
- Characterizations of the solution set of nonsmooth semi-infinite programming problems on Hadamard manifolds
- Feasibility problems via paramonotone operators in a convex setting
- The finite termination of feasible solution sequence for optimization and variational inequality
- Characterizing robust -optimal solution sets for uncertain convex optimization problems
- Characterizations of solution sets of nonsmooth mathematical programming problems
- Characterizations of locally Lipschitz geodesic pseudolinear functions on Hadamard manifolds
- Finite perturbation of convex programs
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- Characterizations of the solution sets of convex programs and variational inequality problems
- The convexity of the solution set of a pseudoconvex inequality
This page was built for publication: Characterization of solution sets of convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640443)
