Sciweavers

1984 search results - page 90 / 397
» The colourful feasibility problem
Sort
View
SIAMJO
2010
133views more  SIAMJO 2010»
13 years 8 months ago
Infeasibility Detection and SQP Methods for Nonlinear Optimization
This paper addresses the need for nonlinear programming algorithms that provide fast local convergence guarantees no matter if a problem is feasible or infeasible. We present an a...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
IMCSIT
2010
13 years 8 months ago
Enhanced Competitive Differential Evolution for Constrained Optimization
Abstract--The constrained optimization with differential evolution (DE) is addressed. A novel variant of competitive differential evolution with a hybridized search of feasibility ...
Josef Tvrdík, Radka Polakova
FOCS
2005
IEEE
14 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 2 months ago
A poset framework to model decentralized control problems
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
Parikshit Shah, Pablo A. Parrilo
ACCV
2007
Springer
13 years 12 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks