Characterizations of solution sets of cone-constrained convex programming problems
From MaRDI portal
Recommendations
- Characterization of solution sets of convex programs
- Characterizations of the solution sets of convex programs and variational inequality problems
- Characterization of solution sets of \(E\)-convex programming problems
- A simple characterization of solutions sets of convex programs
- Characterization of optimal solutions for nonlinear programming problems with conic constraints
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of solution sets for two nonsymmetric cone programs
- Characterizations of asymptotic cone of the solution set of a composite convex optimization problem
- Characterizing the solution set of convex optimization problems without convexity of constraints
Cites work
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 6325420 (Why is no real title available?)
- A simple characterization of solutions sets of convex programs
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Characterization of solution sets of convex programs
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Characterizations of the solution sets of convex programs and variational inequality problems
- Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem
- Conic formulation for \(l_p\)-norm optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Generalizations of Slater's constraint qualification for infinite convex programs
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Notes on Duality in Second Order and p -Order Cone Optimization
- Numerical resolution of cone-constrained eigenvalue problems
- On characterizing the solution sets of pseudolinear programs
- On the generalized fischer-burmeister merit function for the second-order cone complementarity problem
- Optimization and nonsmooth analysis
Cited in
(12)- Aubin property and uniqueness of solutions in cone constrained optimization
- A simple characterization of solutions sets of convex programs
- An alternative approach for a distance inequality associated with the second-order cone and the circular cone
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- Characterizations of solution sets for two nonsymmetric cone programs
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Characterizing the contingent cone's convex kernel
- The inclusion-constrained programming and the cone-constrained programming
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Conditions for the solution of a conic programming
- On merit functions for \(p\)-order cone complementarity problem
- Characterizations of asymptotic cone of the solution set of a composite convex optimization problem
This page was built for publication: Characterizations of solution sets of cone-constrained convex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499701)
