Sciweavers

Share
SIAMJO
2010
88views more  SIAMJO 2010»
9 years 5 months ago
A Primal-Dual Exterior Point Method for Nonlinear Optimization
In this paper, a primal dual method for general possible nonconvex nonlinear optimization problems is considered. The method is an exterior point type method which means that it p...
Hiroshi Yamashita, Takahito Tanabe
SIAMJO
2008
81views more  SIAMJO 2008»
9 years 9 months ago
A First-Order Convergence Analysis of Trust-Region Methods with Inexact Jacobians
A class of trust-region algorithms is developed and analyzed for the solution of minimization problems with nonlinear inequality constraints. Based on composite-step trust region ...
Andrea Walther
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
9 years 10 months ago
Fourier Elimination for Compiling Constraint Hierarchies
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Warwick Harvey, Peter J. Stuckey, Alan Borning
COR
2000
93views more  COR 2000»
9 years 10 months ago
An ellipsoid algorithm for equality-constrained nonlinear programs
Abstract
Sharmila Shah, John E. Mitchell, Michael Kupfersch...
JCIT
2007
62views more  JCIT 2007»
9 years 10 months ago
Identification of Economic Cluster with Information Gain Method, based on Input-Output Tables
In this paper, we propose a more flexible “economic cluster identification” approach to analyzing the domestic I/O flows of intermediary goods and service that is based on inf...
Bae Sangbin, Moon Kyungil
JGS
2006
154views more  JGS 2006»
9 years 10 months ago
Area-to-point Kriging with inequality-type data
In practical applications of area-to-point spatial interpolation, inequality constraints, such as non-negativity, or more general constraints on the maximum and/or minimum allowab...
E.-H. Yoo, Phaedon C. Kyriakidis
ENTCS
2008
93views more  ENTCS 2008»
9 years 10 months ago
Rewriting Interpolants
Abstract. We give a method of constructing an interpolant for linear equality, and inequality constraints over the rational numbers. Our method is based on efficient rewriting tech...
Christopher Lynch, Yuefeng Tang
FOCS
1990
IEEE
10 years 2 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo
ICRA
1999
IEEE
96views Robotics» more  ICRA 1999»
10 years 3 months ago
Interactive Manipulation of Articulated Objects with Geometry Awareness
Techniques for interactive 3D manipulation of articulated objects in cluttered environments should be geometricallyaware, going beyond basic inverse or forward kinematics to allow...
Min-Hyung Choi, James F. Cremer
books