### Reverse convex problems: an approach based on optimality conditions.

Tseveendorj, Ider (2006)

Journal of Applied Mathematics and Decision Sciences

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Tseveendorj, Ider (2006)

Journal of Applied Mathematics and Decision Sciences

Similarity:

Milanka Gardašević Filipović (2009)

The Yugoslav Journal of Operations Research

Similarity:

Marek Smietanski (2008)

Open Mathematics

Similarity:

An algorithm for univariate optimization using a linear lower bounding function is extended to a nonsmooth case by using the generalized gradient instead of the derivative. A convergence theorem is proved under the condition of semismoothness. This approach gives a globally superlinear convergence of algorithm, which is a generalized Newton-type method.

Alber, Y.I., Burachik, R.S., Iusem, A.N. (1997)

Abstract and Applied Analysis

Similarity:

Butnariu, Dan, Resmerita, Elena (2006)

Abstract and Applied Analysis

Similarity:

Liu, San-Yang, Wang, Chun-Feng, Liu, Li-Xia (2010)

Mathematical Problems in Engineering

Similarity:

Stefanov, Stefan M. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Wei Ni, Xiaoli Wang (2016)

Kybernetika

Similarity:

Recently, distributed convex optimization has received much attention by many researchers. Current research on this problem mainly focuses on fixed network topologies, without enough attention to switching ones. This paper specially establishes a new technique called averaging-base approach to design a continuous-time distributed algorithm for convex optimization problem under switching topology. This idea of using averaging was proposed in our earlier works for the consensus problem...

Muñiz-Pérez, Omar (2010)

Abstract and Applied Analysis

Similarity:

Alexander Kaplan, Rainer Tichatschke (1997)

Applications of Mathematics

Similarity:

In this paper new methods for solving elliptic variational inequalities with weakly coercive operators are considered. The use of the iterative prox-regularization coupled with a successive discretization of the variational inequality by means of a finite element method ensures well-posedness of the auxiliary problems and strong convergence of their approximate solutions to a solution of the original problem. In particular, regularization on the kernel of the differential operator and...

Nada I. Đuranović-Miličić (2008)

The Yugoslav Journal of Operations Research

Similarity:

Stefanov, Stefan M. (2006)

Journal of Applied Mathematics and Decision Sciences

Similarity: