Copositive programming has become a useful tool in dealing with all sorts of optimisation problems. It has however been shown by Murty and Kabadi (Math. Program. 39(2):117–129, <CitationRef CitationID="CR20">1987</CitationRef>) that the strong membership problem for the copositive cone, that is deciding whether or not a given matrix is...</citationref>

Nemirovski’s analysis (SIAM J. Optim. 15:229–251, <CitationRef CitationID="CR15">2005</CitationRef>) indicates that the extragradient method has the O(1/t) convergence rate for variational inequalities with Lipschitz continuous monotone operators. For the same problems, in the last decades, a class of Fejér monotone projection and...</citationref>

Complex polynomial optimization problems arise from real-life applications including radar code design, MIMO beamforming, and quantum mechanics. In this paper, we study complex polynomial optimization models where the objective function takes one of the following three forms: (1) multilinear;...

A general class of variational models with concave priors is considered for obtaining certain sparse solutions, for which nonsmoothness and non-Lipschitz continuity of the objective functions pose significant challenges from an analytical as well as numerical point of view. For computing a...

This paper deals with optimizing the cost of set up, transportation and inventory of a multi-stage production system in presence of bottleneck. The considered optimization model is a mixed integer nonlinear program. We propose two methods based on DC (Difference of Convex) programming and DCA...

In this paper, we present a primal-dual interior-point method for solving nonlinear programming problems. It employs a Levenberg-Marquardt (LM) perturbation to the Karush-Kuhn-Tucker (KKT) matrix to handle indefinite Hessians and a line search to obtain sufficient descent at each iteration. We...

A new nonmonotone algorithm is proposed and analyzed for unconstrained nonlinear optimization. The nonmonotone techniques applied in this algorithm are based on the estimate sequence proposed by Nesterov (Introductory Lectures on Convex Optimization: A Basic Course, <CitationRef CitationID="CR13">2004</CitationRef>) for convex...</citationref>

In this paper, we consider two decomposition schemes for the graph theoretical description of the axial Multidimensional Assignment Problem (MAP). The problem is defined as finding n disjoint cliques of size m with minimum total cost in K <Subscript> m×n </Subscript>, which is an m-partite graph with n elements per...</subscript>

Recently an affine scaling, interior point algorithm ASL was developed for box constrained optimization problems with a single linear constraint (Gonzalez-Lima et al., SIAM J. Optim. 21:361–390, <CitationRef CitationID="CR7">2011</CitationRef>). This note extends the algorithm to handle more general polyhedral constraints. With a line...</citationref>

We extend the method of Ghasemi and Marshall (SIAM J. Optim. 22(2):460–473, <CitationRef CitationID="CR1">2012</CitationRef>), to obtain a lower bound f <Subscript>gp,M </Subscript> for a multivariate polynomial <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$f(\mathbf{x}) \in\mathbb{R}[\mathbf {x}]$</EquationSource> </InlineEquation> of degree ≤2d in n variables <Emphasis Type="Bold">x=(x <Subscript>1</Subscript>,…,x <Subscript> n </Subscript>) on the closed ball <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$\{ \mathbf{x} \in\mathbb{R}^{n} :...</equationsource></inlineequation></subscript></subscript></emphasis></equationsource></inlineequation></subscript></citationref>