scientific article; zbMATH DE number 7450966

zbMath1476.90244MaRDI QIDQ5019048

Gwi Soo Kim, Moon Hee Kim, Gue Myung Lee

Publication date: 27 December 2021

Full work available at URL: http://nfaa.kyungnam.ac.kr/journal-nfaa/index.php/NFAA/article/view/1374

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimality conditionssolution setsecond-order cone linear fractional optimization problem

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Linear fractional optimization problems on Jordan Euclidean algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations of the solution sets of convex programs and variational inequality problems
• Characterizations of optimal solution sets of convex infinite programs
• A simple characterization of solutions sets of convex programs
• Characterization of solution sets of quasiconvex programs
• Second-order cone programming
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• On characterizing the solution sets of pseudolinear programs
• Characterizations of the solution set for a class of nonsmooth optimization problems
• Characterizing robust solution sets of convex programs under data uncertainty
• Characterizations of solution sets of convex vector minimization problems
• Characterization of solution sets of convex programs
• Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs

This page was built for publication: