In this paper, a full-Newton step feasible interior-point algorithm is proposed for solving <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$P_*(\kappa )$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mrow> <msub> <mi>P</mi> <mo>∗</mo> </msub> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="italic">κ</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math> </EquationSource> </InlineEquation>-linear complementarity problems. We prove that the full-Newton step to the central path is local quadratically convergent and the proposed algorithm has...</equationsource></equationsource></inlineequation>

In this paper we propose a new simplicial partition-based deterministic algorithm for global optimization of Lipschitz-continuous functions without requiring any knowledge of the Lipschitz constant. Our algorithm is motivated by the well-known <Emphasis Type="SmallCaps">Direct algorithm which evaluates the objective...</emphasis>

In this paper, we introduce a new hybrid iterative scheme for finding a common element of the set of zeroes of a maximal monotone operator, the set of fixed points of a relatively quasi-nonexpansive mapping, the sets of solutions of an equilibrium problem and the variational inequality problem...

In this paper, we introduce a general iterative algorithm for finding a common element of the set of common fixed points of an infinite family of nonexpansive mappings and the set of solutions of systems of variational inequalities for two inverse strongly accretive mappings in a q-uniformly...

In this paper, we propose a new correction strategy for some first-order primal-dual algorithms arising from solving, e.g., total variation image restoration. With this strategy, we can prove the convergence of the algorithm under more flexible conditions than those proposed most recently. Some...

This paper studies the existence, uniqueness and iterative approximations of solutions, bounded solutions and continuous bounded solutions for a functional equation arising in dynamic programming of multistage decision processes by using fixed point theorems and the iterative methods in complete...

This work considers nonsmooth optimal control problems and provides two new sufficient conditions of optimality. The first condition involves the Lagrange multipliers while the second does not. We show that under the first new condition all processes satisfying the Pontryagin Maximum Principle...

In the paper we prove a variant of the well known Filippov–Pliss lemma for evolution inclusions given by multivalued perturbations of m-dissipative differential equations in Banach spaces with uniformly convex dual. The perturbations are assumed to be almost upper hemicontinuous with convex...

We present a new variant of the standard pooling problem in which demands are fixed and there are specific constraints on the intermediate pool. We propose a new formulation composed of proportion-flow variables, and we design an exact branch and bound algorithm by combining existing algorithms....

Geometric branch-and-bound methods are popular solution algorithms in deterministic global optimization to solve problems in small dimensions. The aim of this paper is to formulate a geometric branch-and-bound method for constrained global optimization problems which allows the use of arbitrary...