we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...

We propose a sequential quadratic optimization method for solving nonlinear optimization problems with equality and inequality constraints. The novel feature of the algorithm is that, during each iteration, the primal-dual search direction is allowed to be an inexact solution of a given quadratic optimization subproblem. We present a set of generic, loose conditions that the search direction (i...

We propose a sequential quadratic optimization method for solving nonlinear constrained optimization problems. The novel feature of the algorithm is that, during each iteration, the primal-dual search direction is allowed to be an inexact solution of a given quadratic optimization subproblem. We present a set of generic, loose conditions that the search direction (i.e., inexact subproblem solut...

‎in this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎the proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the newton equation system‎, ‎by using an inexact newton direction‎. ‎furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

Most existing theory of structured prediction assumes exact inference, which is often intractable in many practical problems. This leads to the routine use of approximate inference such as beam search but there is not much theory behind it. Based on the structured perceptron, we propose a general framework of “violation-fixing” perceptrons for inexact search with a theoretical guarantee for con...

Bargaining is a basic game in economic practice. Cournot duopoly game is an important model in bargaining theory and is well studied in the literatures. Recently, asymmetry information [20] and incomplete information [19], limited individual rationality [2] and slightly altruistic equilibrium [10] are introduced into bargaining theory. And computational game theory also comes into being a new h...

We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that can ensure global convergence. Inexact SQP methods are needed for large-scale applications for which the iteration matrix cannot be explicitly formed or factored and the arising linear systems must be solved using itera...