Results 11 to 20 of about 174 (149)

A filter inexact-restoration method for nonlinear programming [PDF]

open access: yes, 2008
Filter method, Inexact-restoration, Line search, 49M37, 65K05, 90C30, 90C55,
Cândida Silva   +3 more
core   +1 more source

Convergence of a short‐step primal‐dual algorithm based on the Gauss‐Newton direction

open access: yesJournal of Applied Mathematics, Volume 2003, Issue 10, Page 517-534, 2003., 2003
We prove the theoretical convergence of a short‐step, approximate path‐following, interior‐point primal‐dual algorithm for semidefinite programs based on the Gauss‐Newton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the first proof of convergence for the Gauss‐Newton direction in this context.
Serge Kruk, Henry Wolkowicz
wiley   +1 more source

An entropic regularization method for solving systems of fuzzy linear inequalities

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 32, Issue 10, Page 579-585, 2002., 2002
Solving systems of fuzzy linear inequalities could lead to the solutions of fuzzy linear programs. It is shown that a system of fuzzy linear inequalities can be converted to a regular min‐max problem. An entropic regularization method is introduced for solving such a problem. Some computational results are included.
F. B. Liu
wiley   +1 more source

A global method for some class of optimization and control problems

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 23, Issue 9, Page 605-616, 2000., 2000
The problem of maximizing a nonsmooth convex function over an arbitrary set is considered. Based on the optimality condition obtained by Strekalovsky in 1987 an algorithm for solving the problem is proposed. We show that the algorithm can be applied to the nonconvex optimal control problem as well.
R. Enkhbat
wiley   +1 more source

Restrict-and-relax search for 0-1 mixed-integer programs

open access: yesEURO Journal on Computational Optimization, 2013
A highly desirable characteristic of methods for solving 0-1 mixed-integer programs is that they should be capable of producing high-quality solutions quickly.
Menal Guzelsoy   +2 more
doaj   +1 more source

Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery

open access: yesResults in Applied Mathematics, 2019
In this article, we propose a three-term conjugate gradient projection algorithm for solving constrained monotone nonlinear equations. The global convergence of the algorithm was established under suitable assumptions.
Auwal Bala Abubakar   +2 more
doaj   +1 more source

Convergence analysis of the iterative methods for quasi complementarity problems

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 11, Issue 2, Page 319-334, 1988., 1988
In this paper, we consider the iterative methods for the quasi complementarity problems of the form where m is a point‐to‐point mapping and T is a continuous mapping from Rn into itself. The algorithms considered in this paper are general and unified ones, which include many existing algorithms as special cases for solving the complementarity problems.
Muhammad Aslam Noor
wiley   +1 more source

Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs

open access: yesOpen Mathematics, 2017
This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong   +3 more
doaj   +1 more source

Using sentinels to detect intersections of convex and nonconvex polygons [PDF]

open access: yes, 2010
We describe finite sets of points, called sentinels, which allow us to decide if isometric copies of polygons, convex or not, intersect. As an example of the applicability of the concept of sentinel, we explain how they can be used to formulate an ...
W.F. Mascarenhas   +3 more
core   +1 more source

A new smoothing method for solving nonlinear complementarity problems

open access: yesOpen Mathematics, 2019
In this paper, a new improved smoothing Newton algorithm for the nonlinear complementarity problem was proposed. This method has two-fold advantages. First, compared with the classical smoothing Newton method, our proposed method needn’t nonsingular of ...
Zhu Jianguang, Hao Binbin
doaj   +1 more source

Home - About - Disclaimer - Privacy