Results 101 to 110 of about 173 (143)

Global search based on efficient diagonal partitions and a set of Lipschitz constants

open access: yes, 2006
. In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz constant is considered.
Yaroslav D. Sergeyev, Dmitri, E. Kvasov
core  

Trust Region Affine Scaling Algorithms for Linearly Constrained Convex and Concave Programs

open access: yes, 1996
We study a trust region affine scaling algorithm for solving the linearly constrained convex or concave programming problem. Under primal nondegeneracy assumption, we prove that every accumulation point of the sequence generated by the algorithm ...
Yanhui Wang, Renato D.C. Monteiro
core  

A robust method based on LOVO functions for solving least squares problems

open access: yes
The robust adjustment of nonlinear models to data is considered in this paper. When data comes from real experiments, it is possible that measurement errors cause the appearance of discrepant values, which should be ignored when adjusting models to them.
W. V. I. Shirabayashi   +3 more
core   +1 more source

A Support Based Algorithm for Optimization with Eigenvalue Constraints

open access: yes, 2013
Optimization of convex functions subject to eigenvalue constraints is intriguing because of peculiar analytical properties of eigenvalues, and is of practical interest because of wide range of applications in fields such as structural design and control ...
Emre Mengi
core  

Home - About - Disclaimer - Privacy