In this paper, we present a generic framework to extend existing uniformly optimal convex programming algorithms to solve more general nonlinear, possibly nonconvex, optimization problems. The basic idea is to incorporate a local search step (gradient descent or Quasi-Newton iteration) into these uniformly optimal convex programming methods, and then enforce a monotone decreasing property of th...

In this paper, we establish certain results concerning the quasiHadamard product of certain classes of uniformly analytic functions. 2000 Mathematics Subject Classification: 30C45.

Here we present a new paraconsistent logic, called quasi-classical logic (or QC logic) that allows the derivation of non-trivializable classical inferences. For this it is necessary that queries are in conjunc-tive normal form and the reasoning process is essentially that of clause nding. We present a proof-theoretic deenition, and semantics, and show that the consequence relation observes reee...