Results 31 to 37 of about 1,360 (37)

Lower bounds for polynomials using geometric programming

open access: yes, 2011
We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares.
Bellare M.   +4 more
core   +4 more sources

A projective splitting algorithm for solving generalized mixed variational inequalities

open access: yesJournal of Inequalities and Applications, 2011
In this paper, a projective splitting method for solving a class of generalized mixed variational inequalities is considered in Hilbert spaces. We investigate a general iterative algorithm, which consists of a splitting proximal point step followed by a ...
Zou Yun-zhi, Xia Fu-quan
doaj  

A Non-Monotone Conjugate Subgradient Type Method for Minimization of Convex Functions

open access: yes, 2019
We suggest a conjugate subgradient type method without any line-search for minimization of convex non differentiable functions. Unlike the custom methods of this class, it does not require monotone decrease of the goal function and reduces the ...
Konnov, Igor
core  

A Positivstellensatz which Preserves the Coupling Pattern of Variables

open access: yes, 2006
We specialize Schm\"udgen's Positivstellensatz and its Putinar and Jacobi and Prestel refinement, to the case of a polynomial $f\in R[X,Y]+R[Y,Z]$, positive on a compact basic semi algebraic set $K$ described by polynomials in $R[X,Y]$ and $R[Y,Z]$ only,
Lasserre, Jean B.
core   +2 more sources

Lp-norms, Log-barriers and Cramer transform in Optimization

open access: yes, 2010
We show that the Laplace approximation of a supremum by Lp-norms has interesting consequences in optimization. For instance, the logarithmic barrier functions (LBF) of a primal convex problem P and its dual appear naturally when using this simple ...
Lasserre, Jean B., Zeron, Eduardo S.
core   +1 more source

Home - About - Disclaimer - Privacy