Results 41 to 50 of about 213 (150)

Using sentinels to detect intersections of convex and nonconvex polygons

, 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, E.G. Birgin, BIRGIN, E.G., MASCARENHAS, W.F.   +3 more
core   +1 more source

Modified four-term conjugate gradient method with applications in image restoration and regression problem

Demonstratio Mathematica
The conjugate gradient (CG) method is recognized for resolving unconstrained optimization problems because of its efficiency, robustness, and minimal memory demands.
Masmali Sultanah, Alhawarat Ahmad, Salleh Zabidin, Masmali Ibtisam, Sabra Ramadan   +4 more
doaj   +1 more source

Uncontrolled inexact information within bundle methods

EURO Journal on Computational Optimization, 2017
We consider convex non-smooth optimization problems where additional information with uncontrolled accuracy is readily available. It is often the case when the objective function is itself the output of an optimization solver, as for large-scale energy ...
Jérôme Malick, Welington de Oliveira, Sofia Zaourar   +2 more
doaj   +1 more source

Second Derivative Free Eighteenth Order Convergent Method for Solving Non-Linear Equations

, 2017
In this paper, the Eighteenth Order Convergent Method (EOCM) developed by Vatti et.al is considered and this method is further studied without the presence of second derivative.
Ramadevi Sri, M.S.Kumar Mylapalli, V.B. Kumar Vatti   +2 more
core   +1 more source

A penalty barrier framework for nonconvex constrained optimization [PDF]

Journal of Nonsmooth Analysis and Optimization
We consider minimization problems with structured objective function and smooth constraints, and present a flexible framework that combines the beneficial regularization effects of (exact) penalty and interior-point methods.
Alberto De Marchi, Andreas Themelis
doaj   +1 more source

Eighteenth Order Convergent Method for Solving Non-Linear Equations

, 2017
In this paper, we suggest and discuss an iterative method for solving nonlinear equations of the type f(x)=0 having eighteenth order convergence. This new technique based on Newton’s method and extrapolated Newton’s method.
Ramadevi Sri, M.S Mylapalli, V.B Vatti
core   +1 more source

Modelling and solving the production rate variation problem (PRVP)

Just-in-time, Scheduling, 65K05, 65K10,
Albert Corominas, Joaquín Bautista, Ramon Companys   +2 more
core   +1 more source

Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization

combinatorial optimization, branch and bound, artificial intelligence, 65K05, 65K10,
Albert Corominas, Rafael Pastor
core   +1 more source

A globally convergent augmented Lagrangian algorithm for optimization with general constraints simple bounds

, 1991
. The global and local convergence properties of a class of augmented Lagrangian methods for solving nonlinear programming problems are considered. In such methods, simple bound constraints are treated separately from more general constraints and the ...
Nicholas I. M. Gould, L. Toint, Philippe, Andrew R. Conn, Gould NIM, Conn AR, Toint PL   +6 more
core   +1 more source

Alternating direction method for bi-quadratic programming

Alternating direction method, Bi-quadratic programming, Quadratic semidefinite programming, 65F15, 65K05, 90C90,
Sheng-Long Hu, Zheng-Hai Huang
core   +1 more source