Characterization of solution sets of convex programs
From MaRDI portal
Publication:2640443
DOI10.1016/0167-6377(91)90087-6zbMath0719.90055OpenAlexW2016824559MaRDI QIDQ2640443
James V. Burke, Michael C. Ferris
Publication date: 1991
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/59132
Related Items (53)
Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems ⋮ An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Characterization of solution sets of convex programs ⋮ On characterizing the solution sets of pseudolinear programs ⋮ Characterizations of the solution sets of convex programs and variational inequality problems ⋮ Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization ⋮ On characterizing solution set of non-differentiable η-pseudolinear extremum problem ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ A note on characterizing solution set of nonsmooth pseudoinvex optimization problem ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ The Geometry of Sparse Analysis Regularization ⋮ On characterizations of solution sets of interval-valued quasiconvex programming problems ⋮ Pseudomonotone operators: a survey of the theory and its applications ⋮ Characterizations of the solution set for a class of nonsmooth optimization problems ⋮ Characterization of solution sets of quasiconvex programs ⋮ Characterizations of pseudoconvex functions and semistrictly quasiconvex ones ⋮ Unnamed Item ⋮ Finite termination of the proximal point algorithm ⋮ The convexity of the solution set of a pseudoconvex inequality ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ Characterizations of solution sets of cone-constrained convex programming problems ⋮ On alternative optimal solutions to quasimonotonic programming with linear constraints ⋮ A note on characterization of solution sets to pseudolinear programming problems ⋮ Minimum principle sufficiency ⋮ Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems ⋮ Modified proximal point algorithm for extended linear-quadratic programming ⋮ Ergodic convergence in subgradient optimization ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ Characterization of solution sets of convex optimization problems in Riemannian manifolds ⋮ 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 ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials ⋮ Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers ⋮ 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 ⋮ Finite perturbation of convex programs ⋮ Infinite-dimensional convex programming with applications to constrained approximation
Cites Work
This page was built for publication: Characterization of solution sets of convex programs
