Results 81 to 90 of about 253 (176)
Order preserving functions and generalized convexity
Primary 26B25, Secondary 90C30, 6A10, Generalized Convexity, Order Preservation, Mathematical Programming,
E. Castagnoli, P. Mazzoleni
core +1 more source
Extended local convergence analysis of inexact Gauss-Newton method for singular systems of equations under weak conditions [PDF]
, 2017 A new local convergence analysis of the Gauss-Newton method for solving some optimization problems is presented using restricted convergence domains. The results extend the applicability of the Gauss-Newton method under the same computational cost given ...
ARGYROS , Ioannis K., GEORGE, Santhosh
core +1 more source
A class of r-semipreinvex functions and optimality in nonlinear programming
Semi-connected sets, Semipreinvex functions, r-Semipreinvex functions, Optimality, Nonlinear programming, 90C25, 90C26, 90C30,
Ke Zhao, Zhe Chen, Xue Liu
core +1 more source
Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras
Programación Geométrica, Algoritmos, Langragianos Aumentados, 90C30, Geometric Programming, Algorithms, Augmented Lagrangian Functions,
Eduardo Méndez
core +1 more source
A comparison of edge-preserving approaches for differential interference contrast microscopy [PDF]
, 2017 International audienceIn this paper we address the problem of estimating the phase from color images acquired with differential–interference–contrast microscopy.
Bautista, Lola +12 more
core +1 more source
, 1970 The concepts of (Φ, ρ)-invexity have been given by Carsiti,Ferrara and Stefanescu[32]. We consider a second-order dual model associated to a multiobjective programming problem involving support functions and a weak duality result is established under ...
Bandana Priya, Ganesh Kumar Thakur
core +1 more source
Tensor methods for finding approximate stationary points of convex functions. [PDF]
Optim Methods Softw, 2022 Grapiglia GN, Nesterov Y.
europepmc +1 more source
On due-date based valid cuts for the sequential ordering problem
Integer Programming, Lagrangean relaxation, Hamiltonian Path, Valid Cuts, Tightening, 90C10, 90C27, 90C30,
L. Escudero, M. Ortuño
core +1 more source
Using truncated conjugate gradient method in trust-region method with two subproblems and backtracking line search [PDF]
, 2010 A trust-region method with two subproblems and backtracking line search for solving unconstrained optimization is proposed. At every iteration, we use the truncated conjugate gradient method or its variation to solve one of the two subproblems ...
Mingyun Tang +3 more
core +1 more source