Results 121 to 130 of about 231 (178)

Detection and Remediation of Stagnation in the Nelder-Mead Algorithm Using a Sufficient Decrease Condition

open access: yes, 1997
. The Nelder-Mead algorithm can stagnate and converge to a non-optimal point, even for very simple problems. In this note we propose a test for sufficient decrease which, if passed for the entire iteration, will guarantee convergence of the Nelder-Mead ...
C. T. Kelley
core  

A NOVEL MONOTONIZATION TRANSFORMATION FOR SOME CLASSES OF GLOBAL OPTIMIZATION PROBLEMS

open access: yes
A novel monotonization method is proposed for converting a non-monotone programming problem into a monotone programming problem. An equivalent monotone programming problem with only inequality constraints is obtained via this monotonization method.
FU-SHENG BAI, ZHI-YOU WU
core  

Merit Functions and Descent Algorithms for a Class of Variational Inequality Problems

open access: yes, 1997
. We consider a variational inequality problem, where the cost mapping is the sum of a single-valued mapping and the subdifferential mapping of a convex function. For this problem we introduce a new class of equivalent optimization formulations; based on
Michael Patriksson, Patriksson, Michael
core  

On the accurate identification of active constraints

open access: yes, 1998
. We consider nonlinear programs with inequality constraints, and we focus on the problem of identifying those constraints which will be active at an isolated local solution.
Francisco Facchinei   +2 more
core  

Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions

open access: yes, 2014
This paper presents a canonical dual approach for solving a nonconvex global op-timization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences.
Yi Chen, David Y Gao
core  

Home - About - Disclaimer - Privacy