An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint.

Stefanov, Stefan M.

The search session has expired. Please query the service again.

Displaying similar documents to “An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint.”

Convex separable minimization problems with a linear constraint and bounded variables.

Stefanov, Stefan M. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in $ℝ^{n}$ .

Stefanov, Stefan M. (2004)

Journal of Applied Mathematics

Similarity:

The Benders method and parametrization of the right-hand sides in the mixed integer linear programming problem

Jaroslav Hrouda (1976)

Aplikace matematiky

Similarity:

A primal-infeasible interior point algorithm for linearly constrained convex programming

Yanjin Wang, Pusheng Fei (2009)

Control and Cybernetics

Similarity:

A Modified Step-Length Algorithm in Nonlinear Programming

Nada I. Žuranović-Miličić (2000)

The Yugoslav Journal of Operations Research

Similarity:

An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function

José Luis Quintero, Alejandro Crema (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.

An Algorithm for $L C^{1}$ Optimization

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

The Yugoslav Journal of Operations Research

Similarity:

An optimal algorithm with Barzilai-Borwein steplength and superrelaxation for QPQC problem

Pospíšil, Lukáš

Similarity:

We propose a modification of MPGP algorithm for solving minimizing problem of strictly convex quadratic function subject to separable spherical constraints. This active set based algorithm explores the faces by the conjugate gradients and changes the active sets and active variables by the gradient projection with the Barzilai-Borwein steplength. We show how to use the algorithm for the solution of separable and equality constraints. The power of our modification is demonstrated on the...