Sciweavers

32 search results - page 3 / 7
» An Inexact SQP Method for Equality Constrained Optimization
Sort
View
EOR
2010
160views more  EOR 2010»
13 years 5 months ago
A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
Jie Sun, Su Zhang
SIAMJO
2010
83views more  SIAMJO 2010»
13 years 3 months ago
The Lifted Newton Method and Its Application in Optimization
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
Jan Albersmeyer, Moritz Diehl
GECCO
2005
Springer
157views Optimization» more  GECCO 2005»
13 years 10 months ago
Simple addition of ranking method for constrained optimization in evolutionary algorithms
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...
Pei Yee Ho, Kazuyuki Shimizu
CEC
2005
IEEE
13 years 11 months ago
Linear equality constraints and homomorphous mappings in PSO
We present a homomorphous mapping that converts problems with linear equality constraints into fully unconstrained and lower-dimensional problems for optimization with PSO. This ap...
Christopher K. Monson, Kevin D. Seppi
ICAL
2011
301views more  ICAL 2011»
12 years 4 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...