A simple characterization of solutions sets of convex programs
From MaRDI portal
Publication:1108196
DOI10.1016/0167-6377(88)90047-8zbMath0653.90055WikidataQ111305259 ScholiaQ111305259MaRDI QIDQ1108196
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(88)90047-8
nonsmooth optimization; subdifferential; solution set; subgradient; convex quadratic program; monotone linear complementarity; polyhedral characterization
90C25: Convex programming
90C20: Quadratic programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Minimum-support solutions of polyhedral concave programs*, Global error bounds for convex quadratic inequality systems*, Optimality conditions for bilevel programming problems, Limiting behavior of the central path in semidefinite optimization, Convex composite multi-objective nonsmooth programming, Error bounds for nondegenerate monotone linear complementarity problems, Finite convergence of algorithms for nonlinear programs and variational inequalities, 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, Pseudolinear fuzzy mappings, The convexity of the solution set of a pseudoconvex inequality, 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, Minimum principle sufficiency, New uniform parametric error bounds, Error bounds and strong upper semicontinuity for monotone affine variational inequalities, Infinite-dimensional convex programming with applications to constrained approximation, On closed convex sets without boundary rays and asymptotes, Characterization of solution sets of quasiconvex programs, Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs, Second-order global optimality conditions for optimization problems, On characterizing the solution sets of pseudolinear programs, Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints, On alternative optimal solutions to quasimonotonic programming with linear constraints, Asymptotic behavior of the central path for a special class of degenerate SDP problems, Characterizations of solution sets of convex vector minimization problems, A note on finite termination of iterative algorithms in mathematical programming, Characterization of solution sets of convex programs, Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming, Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems, A Variable-Complexity Norm Maximization Problem
Cites Work
