Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
From MaRDI portal
Publication:1685581
DOI10.1007/s10898-017-0542-9zbMath1395.90237OpenAlexW2725387418MaRDI QIDQ1685581
Eladio Ocaña, William Echegaray, Fernando Flores-Bazán, Fabián Flores-Bazan
Publication date: 14 December 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0542-9
quadratic programminglinear fractional programmingstrong dualityzero duality gapquasiconvex programming
Convex programming (90C25) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Linear-quadratic optimal control problems (49N10) Duality theory (optimization) (49N15)
Related Items
Unnamed Item ⋮ Toward nonquadratic S-lemma: new theory and application in nonconvex optimization ⋮ Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems ⋮ On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization ⋮ Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- S-lemma with equality and its applications
- First- and second-order asymptotic analysis with applications in quasiconvex optimization
- Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives
- Handbook of generalized convexity and generalized monotonicity
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Fenchel's duality theorem for nearly convex functions
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
- Duality for almost convex optimization problems via the perturbation approach
- Separation of sets and Wolfe duality
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Some convex programs without a duality gap
- Some applications of the image space analysis to the duality theory for constrained extremum problems
- An optimal alternative theorem and applications to mathematical programming
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- Conjugate duality in convex optimization
- Zero duality gaps in infinite-dimensional programming
- A solvability theorem for a class of quasiconvex mappings with applications to optimization
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Existence theory for finite-dimensional pseudomonotone equilibrium problems
- Existence of optimal solutions and duality results under weak conditions
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Duality gap in convex programming
- Convexity for set-valued maps
- Strong duality for generalized monotropic programming in infinite dimensions
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Convexity of quadratic transformations and its use in control and optimization
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Gordan-Type Alternative Theorems and Vector Optimization Revisited
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Coercivity properties and well-posedness in vector optimization
- On the Convexity of the Value Function for a Class of Nonconvex Variational Problems: Existence and Optimality Conditions
- Strong Duality in Cone Constrained Nonconvex Optimization
- Conditions for zero duality gap in convex programming
- Linear Systems of Real Quadratic Forms
- Convex Analysis
- On the mapping of quadratic forms
This page was built for publication: Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
