<Para ID="Par1">This paper introduces three novel techniques for updating the invertible representation of the basis matrix when solving practical sparse linear programming problems using a high performance implementation of the dual revised simplex method, being of particular value when suboptimization is...</para>

It is well known that the conjugate gradient method and a quasi-Newton method, using any well-defined update matrix from the one-parameter Broyden family of updates, produce identical iterates on a quadratic problem with positive-definite Hessian. This equivalence does not hold for any...

Based on a vectorization result in set optimization with respect to the set less order relation, this paper shows how to relate two nonempty sets on a computer. This result is developed for generalized convex sets and polyhedral sets in finite dimensional spaces. Using this approach a numerical...

<Para ID="Par1">We present a local convergence analysis of Gauss-Newton method for solving nonlinear least square problems. Using more precise majorant conditions than in earlier studies such as Chen (Comput Optim Appl 40:97–118, <CitationRef CitationID="CR8">2008</CitationRef>), Chen and Li (Appl Math Comput 170:686–705, <CitationRef CitationID="CR9">2005</CitationRef>), Chen and Li (Appl...</citationref></citationref></para>

<Para ID="Par1">In this paper, we present a smoothing Levenberg–Marquardt algorithm for the solution of the semi-infinite programming (SIP) problem. We first reformulate the KKT system of SIP problem into a system of constrained nonsmooth equations. Then we solve this system by a smoothing...</para>

<Para ID="Par1">We consider fully discrete finite element approximations of a distributed optimal control problem, constrained by the evolutionary Stokes equations. Conforming finite element methods for spatial discretization combined with discontinuous time-stepping Galerkin schemes are being used for the...</para>

In this paper, we study a class of generalized monotone variational inequality (GMVI) problems whose operators are not necessarily monotone (e.g., pseudo-monotone). We present non-Euclidean extragradient (N-EG) methods for computing approximate strong solutions of these problems, and demonstrate...

In this work we propose a class of quasi-Newton methods to minimize a twice differentiable function with Lipschitz continuous Hessian. These methods are based on the quadratic regularization of Newton’s method, with algebraic explicit rules for computing the regularizing parameter. The...

In this paper, we study the semilocal convergence on a class of improved Chebyshev methods for solving nonlinear equations in Banach spaces. Different from the results for Chebyshev method considered in Hernández and Salanova (J Comput Appl Math 126:131–143, <CitationRef CitationID="CR5">2000</CitationRef>), these methods are free from...</citationref>

<Para ID="Par1">Recently, a walk-and-round heuristic was proposed by Huang and Mehrotra (Comput Optim Appl, <CitationRef CitationID="CR24">2012</CitationRef>) for generating high quality feasible solutions of mixed integer linear programs. This approach uses geometric random walks on a polyhedral set to sample points in this set. It subsequently rounds...</citationref></para>