Inequality systems and global optimization
From MaRDI portal
Recommendations
Cited in
(42)- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- A new approach to strong duality for composite vector optimization problems
- Optimization of the difference of ICR functions
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Lagrange duality in canonical DC programming
- Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Analytical linear inequality systems and optimization
- The stable duality of DC programs for composite convex functions
- Approximate optimality conditions for minimax programming problems
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
- A Global Approach to Nonlinearly Constrained Best Approximation
- Characterizations of minimal elements of upper support with applications in minimizing DC functions
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Some new Farkas-type results for inequality systems with DC functions
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
- scientific article; zbMATH DE number 823388 (Why is no real title available?)
- Inequality systems and optimization
- The strong conical hull intersection property for convex programming
- Generalized input-output inequality systems
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Inequity averse optimization in operational research
- Global minimization of the difference of increasing co-radiant and quasi-concave functions
- Dual optimality conditions for the difference of extended real valued increasing co-radiant functions
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- An alternative formulation for a new closed cone constraint qualification
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- New Farkas-type constraint qualifications in convex infinite programming
- Characterizations of solution sets of convex vector minimization problems
- Sequential optimality conditions for multiobjective fractional programming problems
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- On robust duality for fractional programming with uncertainty data
- Characterization of d.c. Functions in terms of quasidifferentials
- Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points*
- Knowledge-based semidefinite linear programming classifiers
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
- A closedness condition and its applications to DC programs with convex constraints
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
This page was built for publication: Inequality systems and global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923916)
