Characterizations of solution sets of cone-constrained convex programming problems
type: Item
instance of: scholarly article
title: Characterizations of solution sets of cone-constrained convex programming problems
zbMATH Open document ID: 1332.90201
author: Xin-He Miao
author: Jein-Shan Chen
published in: Optimization Letters
publication date: 2015-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6489775
zbMATH Keywords: convex programs
zbMATH Keywords: Lagrange multipliers
zbMATH Keywords: \(\mathcal{K}\)-convex mapping
zbMATH Keywords: normal cone
zbMATH Keywords: KKT conditions
MaRDI profile type: Publication
full work available at URL: s11590-015-0900-9
OpenAlex ID: W2153961109
cites work: Notes on Duality in Second Order and p -Order Cone Optimization
cites work: Q4830373
cites work: Characterization of solution sets of convex programs
cites work: Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem
cites work: An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
cites work: Optimization and nonsmooth analysis
cites work: Numerical resolution of cone-constrained eigenvalue problems
cites work: Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Conic formulation for \(l_p\)-norm optimization
cites work: Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
cites work: Generalizations of Slater's constraint qualification for infinite convex programs
cites work: On characterizing the solution sets of pseudolinear programs
cites work: A simple characterization of solutions sets of convex programs
cites work: On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem
cites work: Characterizations of the solution sets of convex programs and variational inequality problems
cites work: Q5495616
DOI: 10.1007/S11590-015-0900-9
Recommended article: Characterization of solution sets of convex programs
Recommended article: Characterizations of the solution sets of convex programs and variational inequality problems
Recommended article: Q4927868
Recommended article: A simple characterization of solutions sets of convex programs
Recommended article: Characterization of optimal solutions for nonlinear programming problems with conic constraints
Recommended article: Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
Recommended article: Characterizations of solution sets of convex vector minimization problems
Recommended article: Q5147199
Recommended article: Characterizations of asymptotic cone of the solution set of a composite convex optimization problem
Recommended article: Characterizing the solution set of convex optimization problems without convexity of constraints
description: scientific article; zbMATH DE number 6489775