In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.

The conformational behavior of monosubstituted tri-methylsilyle ethynyl Derivative of Cal ix[4]arene as a newgeneration of Caliarene was compared with tetra alkylated calyx[4]arene. The most important conformationalphenomena in these compounds which are pinched cone interconversion process were done by semi-empiricalmethod and ab initio calculations with Gaussian 98w programming.

To address the classic interior tomography problem where projections at each view extend only to the shadow of a circular region completely interior to the subject being scanned, previously we showed that the exact recovery of twoand three-dimensional piecewise smooth images is guaranteed using a one-dimensional generalized total variation seminorm penalty which allows a much faster reconstruct...

the conformational behavior of monosubstituted tri-methylsilyle ethynyl derivative of cal ix[4]arene as a newgeneration of caliarene was compared with tetra alkylated calyx[4]arene. the most important conformationalphenomena in these compounds which are pinched cone interconversion process were done by semi-empiricalmethod and ab initio calculations with gaussian 98w programming.

We update the systematic studies of circular polarization in integrated pulse profiles by Han et al (1998). Data of circular polarization profiles are compiled. Sense reversals can occur in core or cone components, or near the intersection between components. The correlation between the sense of circular polarization and the sense of position angle variation for conal-double pulsars is confirme...

‎In this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎The proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the Newton equation system‎, ‎by using an inexact Newton direction‎. ‎Furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

Introduction Efficient fitting of quadric surfaces to unstructured point clouds or triangle meshes is an important component of many reverse engineering systems [6]. Users may prefer a given surface be fit by a specific quadric type: for example, they may want to ensure the quadric is a cone, ellipsoid, or a rotationally-symmetric subtype (spheroid, circular cone, etc). Methods for type-specifi...

Ultimate limits of an open pit, which define its size and shape at the end of the mine’s life, is the pit with the highest profit value. A number of algorithms such as floating or moving cone method, floating cone method II and the corrected forms of this method, the Korobov algorithm and the corrected form of this method, dynamic programming and the Lerchs and Grossmann algorithm based on grap...

In the conic formulation of a convex optimization problem the constraints are expressed as linear inequalities with respect to a possibly non-polyhedral convex cone. This makes it possible to formulate elegant extensions of interior-point methods for linear programming to general nonlinear convex optimization. Recent research on cone programming algorithms has particularly focused on three conv...