Results 21 to 30 of about 231 (178)

Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces

open access: yesOpen Mathematics, 2019
A new class of generalized convex set-valued maps termed relatively solid generalized cone-subconvexlike maps is introduced in real linear spaces not equipped with any topology.
Liang Hongwei, Wan Zhongping
doaj   +1 more source

Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem

open access: yesOpen Mathematics, 2019
This paper provides some new characterizations of the solution sets for non-differentiable generalized convex fuzzy optimization problem. Firstly, we introduce some new generalized convex fuzzy functions and discuss the relationships among them. Secondly,
Chen Wang, Zhou Zhiang
doaj   +1 more source

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

Least Change Secant Update Methods for Nonlinear Complementarity Problem

open access: yesIngeniería y Ciencia, 2015
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

First-Order Methods for Convex Optimization

open access: yesEURO Journal on Computational Optimization, 2021
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

Presolving linear bilevel optimization problems

open access: yesEURO Journal on Computational Optimization, 2021
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

Asymptotic stationarity and regularity for nonsmooth optimization problems [PDF]

open access: yesJournal of Nonsmooth Analysis and Optimization, 2020
Based on the tools of limiting variational analysis, we derive a sequential necessary optimality condition for nonsmooth mathematical programs which holds without any additional assumptions. In order to ensure that stationary points in this new sense are
Patrick Mehlitz
doaj   +1 more source

Optical vortices in dispersive nonlinear Kerr‐type media

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 18, Page 949-967, 2004., 2004
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

A reduced space branch and bound algorithm for a class of sum of ratios problems

open access: yesOpen Mathematics, 2018
Sum of ratios problem occurs frequently in various areas of engineering practice and management science, but most solution methods for this kind of problem are often designed for determining local solutions .
Zhao Yingfeng, Zhao Ting
doaj   +1 more source

A remark on a complementarity problem in Banach space

open access: yesInternational Journal of Stochastic Analysis, Volume 2004, Issue 3, Page 283-285, 2004., 2004
We give a modified proof of the theorem given in an earlier paper of the author (1994).
Sudarsan Nanda
wiley   +1 more source

Home - About - Disclaimer - Privacy