Results 21 to 30 of about 1,405 (117)
Optical vortices in dispersive nonlinear Kerr‐type media
The applied method of slowly varying amplitudes gives us the possibility to reduce the nonlinear vector integrodifferential wave equation of the electrical and magnetic vector fields to the amplitude vector nonlinear differential equations. Using this approximation, different orders of dispersion of the linear and nonlinear susceptibility can be ...
Lubomir M. Kovachev
wiley +1 more source
Positive Definiteness and Semi-Definiteness of Even Order Symmetric Cauchy Tensors [PDF]
Motivated by symmetric Cauchy matrices, we define symmetric Cauchy tensors and their generating vectors in this paper. Hilbert tensors are symmetric Cauchy tensors.
Chen, Haibin, Qi, Liqun
core +1 more source
Least Change Secant Update Methods for Nonlinear Complementarity Problem
In this work, we introduce a family of Least Change Secant Update Methods for solving Nonlinear Complementarity Problems based on its reformulation as a nonsmooth system using the one-parametric class of nonlinear complementarity functions introduced by ...
Favián Arenas A +2 more
doaj +1 more source
A remark on a complementarity problem in Banach space
We give a modified proof of the theorem given in an earlier paper of the author (1994).
Sudarsan Nanda
wiley +1 more source
First-Order Methods for Convex Optimization
First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj +1 more source
We consider a new class of equilibrium problems, known as hemiequilibrium problems. Using the auxiliary principle technique, we suggest and analyze a class of iterative algorithms for solving hemiequilibrium problems, the convergence of which requires either pseudomonotonicity or partially relaxed strong monotonicity. As a special case, we obtain a new
Muhammad Aslam Noor
wiley +1 more source
Presolving linear bilevel optimization problems
Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj +1 more source
We consider the problem of projecting a point onto a region defined by a linear equality or inequality constraint and two‐sided bounds on the variables. Such problems are interesting because they arise in various practical problems and as subproblems of gradient‐type methods for constrained optimization.
Stefan M. Stefanov
wiley +1 more source
Existence of solutions of minimization problems with an increasing cost function and porosity
We consider the minimization problem f(x) → min, x ∈ K, where K is a closed subset of an ordered Banach space X and f belongs to a space of increasing lower semicontinuous functions on K. In our previous work, we showed that the complement of the set of all functions f, for which the corresponding minimization problem has a solution, is of the first ...
Alexander J. Zaslavski
wiley +1 more source
Optimizing condition numbers [PDF]
In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function.
Jane J. Ye, Lewis A.S., Pierre Maréchal
core +1 more source

