Characterizations of solution sets of cone-constrained convex programming problems
From MaRDI portal
Publication:499701
DOI10.1007/s11590-015-0900-9zbMath1332.90201OpenAlexW2153961109MaRDI QIDQ499701
Publication date: 6 October 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0900-9
Related Items (3)
An alternative approach for a distance inequality associated with the second-order cone and the circular cone ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ On merit functions for \(p\)-order cone complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Conic formulation for \(l_p\)-norm optimization
- Characterizations of the solution sets of convex programs and variational inequality problems
- Numerical resolution of cone-constrained eigenvalue problems
- A simple characterization of solutions sets of convex programs
- Generalizations of Slater's constraint qualification for infinite convex programs
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing the solution sets of pseudolinear programs
- Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Characterization of solution sets of convex programs
- Optimization and nonsmooth analysis
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Notes on Duality in Second Order and p -Order Cone Optimization
- On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem
This page was built for publication: Characterizations of solution sets of cone-constrained convex programming problems
