Pages that link to "Item:Q2640443"

The following pages link to Characterization of solution sets of convex programs (Q2640443):

Displaying 50 items.

• Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities (Q368600) (← links)
• A new approach to characterize the solution set of a pseudoconvex programming problem (Q390484) (← links)
• Finite termination of inexact proximal point algorithms in Hilbert spaces (Q493258) (← links)
• Characterizations of solution sets of cone-constrained convex programming problems (Q499701) (← links)
• Finite perturbation of convex programs (Q810372) (← links)
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
• Characterizations of the solution sets of convex programs and variational inequality problems (Q868556) (← links)
• The convexity of the solution set of a pseudoconvex inequality (Q938728) (← links)
• On characterizing the solution sets of pseudoinvex extremum problems (Q1016423) (← links)
• Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces (Q1024244) (← links)
• Characterizations of optimal solution sets of convex infinite programs (Q1024702) (← links)
• Finite termination of the proximal point algorithm (Q1176570) (← links)
• Minimum principle sufficiency (Q1198327) (← links)
• Modified proximal point algorithm for extended linear-quadratic programming (Q1203069) (← links)
• Infinite-dimensional convex programming with applications to constrained approximation (Q1321276) (← links)
• Characterization of solution sets of quasiconvex programs (Q1411529) (← links)
• Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
• Characterizations of the solution set for non-essentially quasiconvex programming (Q1686559) (← links)
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs (Q1771100) (← links)
• On characterizing the solution sets of pseudolinear programs (Q1904699) (← links)
• Generalized weak sharp minima in cone-constrained convex optimization with applications (Q1935574) (← links)
• A note on characterizing solution set of nonsmooth pseudoinvex optimization problem (Q1936800) (← links)
• Characterizations of the solution set for a class of nonsmooth optimization problems (Q1947617) (← links)
• An approach to characterizing \(\epsilon\)-solution sets of convex programs (Q2146365) (← links)
• Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization (Q2182861) (← links)
• Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) (← links)
• Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems (Q2251569) (← links)
• Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
• Optimality conditions and constraint qualifications for quasiconvex programming (Q2278888) (← links)
• Characterization of solution sets of convex optimization problems in Riemannian manifolds (Q2291683) (← links)
• Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems (Q2322364) (← links)
• Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
• Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications (Q2341101) (← links)
• Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (Q2351521) (← links)
• Optimality conditions in optimization problems with convex feasible set using convexificators (Q2408896) (← links)
• Characterizations of solution sets of differentiable quasiconvex programming problems (Q2420773) (← links)
• Pseudomonotone operators: a survey of the theory and its applications (Q2429408) (← links)
• Characterizations of pseudoconvex functions and semistrictly quasiconvex ones (Q2434631) (← links)
• On alternative optimal solutions to quasimonotonic programming with linear constraints (Q2465013) (← links)
• Characterizations of solution sets of convex vector minimization problems (Q2503214) (← links)
• Characterization of solution sets of convex programs (Q2640443) (← links)
• On characterizing solution set of non-differentiable η-pseudolinear extremum problem (Q3225080) (← links)
• Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems (Q3446578) (← links)
• Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers (Q3648624) (← links)
• Ergodic convergence in subgradient optimization (Q4391290) (← links)
• Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis (Q4430668) (← links)
• A note on characterization of solution sets to pseudolinear programming problems (Q4650237) (← links)
• Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials (Q4985185) (← links)
• (Q5019048) (← links)
• Characterizations of the solution set for tangentially convex optimization problems (Q6043119) (← links)