Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
From MaRDI portal
Recommendations
- Necessary global optimality conditions for nonlinear programming problems
- Global optimality conditions and optimization methods for polynomial programming problems
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Global optimality conditions for nonlinear programming problems with linear equality constraints
- Global optimality conditions for a class of polynomial integer programming problems with linear constraints
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- Conditions for global optimality. II
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Fractional programming with convex quadratic forms and functions
- Global optimization with polynomials and the problem of moments
- Handbook of global optimization. Vol. 2
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- Minimizing polynomials via sum of squares over the gradient ideal
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Nonsmooth vector functions and continuous optimization
- Positive polynomials and sums of squares
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Transposition Theorems and Qualification‐Free Optimality Conditions
Cited in
(20)- Global error bounds for piecewise convex polynomials
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Transposition Theorems and Qualification‐Free Optimality Conditions
- Optimality conditions for minimizers at infinity in polynomial programming
- Global optimality conditions and optimization methods for polynomial programming problems
- Optimality conditions and optimization methods for quartic polynomial optimization
- Optimality conditions for the minimization of quadratic \(0-1\) problems
- Feasible partition problem in reverse convex and convex mixed-integer programming
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Necessary global optimality conditions for nonlinear programming problems
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
- Global optimality conditions for nonlinear programming problems with linear equality constraints
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- scientific article; zbMATH DE number 7323312 (Why is no real title available?)
This page was built for publication: Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623367)
