UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A primal-dual regularized interior-point method for semidefinite programming

Optimization methods & software, 2017-01, Vol.32 (1), p.193-219

2017

Volltextzugriff (PDF)

Algorithms for Constrained Minimization of Smooth Nonlinear Functions

1982

Volltextzugriff (PDF)

On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability

Journal of optimization theory and applications, 2008-10, Vol.139 (1), p.127-140

2008

Volltextzugriff (PDF)

Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

Mathematical programming, 1997-01, Vol.76 (1), p.131-154

1997

Volltextzugriff (PDF)

Decomposition and Nondifferentiable Optimization with the Projective Algorithm

Management science, 1992-02, Vol.38 (2), p.284-302

1992

Volltextzugriff (PDF)

Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach

Computers & operations research, 2004-04, Vol.31 (5), p.721-743

2004

Volltextzugriff (PDF)

A cutting plane method from analytic centers for stochastic programming

Mathematical programming, 1995-07, Vol.69 (1-3), p.45-73

1995

Volltextzugriff (PDF)

Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method

Journal of optimization theory and applications, 1999-04, Vol.101 (1), p.35-58

1999

Volltextzugriff (PDF)

Using central prices in the decomposition of linear programs

European journal of operational research, 1993-02, Vol.64 (3), p.393-409

1993

Volltextzugriff (PDF)

On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities

Computational optimization and applications, 1999-01, Vol.12 (1-3), p.127-155

1999

Volltextzugriff (PDF)

A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems

SIAM journal on optimization, 1998-11, Vol.8 (4), p.1108-1131

1998

Volltextzugriff (PDF)

Long-step interior-point algorithms for a class of variational inequalities with monotone operators

Journal of optimization theory and applications, 1998-04, Vol.97 (1), p.181-210

1998

Volltextzugriff (PDF)

Convergence of a simple subgradient level method

Mathematical programming, 1999-05, Vol.85 (1), p.207-211

1999

Volltextzugriff (PDF)

On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm

Mathematical programming, 1993-06, Vol.60 (1), p.81-92

1993

Volltextzugriff (PDF)

Cutting planes and column generation techniques with the projective algorithm

Journal of optimization theory and applications, 1990-06, Vol.65 (3), p.409-429

1990

Volltextzugriff (PDF)

The Relaxation Method for Solving Systems of Linear Inequalities

Mathematics of operations research, 1980-08, Vol.5 (3), p.388-414

Goffin, J. L

1980

Volltextzugriff (PDF)

Short Steps with Karmarkar’s Projective Algorithm for Linear Programming

SIAM journal on optimization, 1994-02, Vol.4 (1), p.193-207

1994

Volltextzugriff (PDF)

Shallow, deep and very deep cuts in the analytic center cutting plane method

Mathematical programming, 1999, Vol.84 (1), p.89-103

1999

Volltextzugriff (PDF)

On the non-polynomiality of the relaxation method for systems of linear inequalities

Mathematical programming, 1982-12, Vol.22 (1), p.93-103

Goffin, J. L.

1982

Volltextzugriff (PDF)

Efficient Production-Distribution System Design

Management science, 2005-07, Vol.51 (7), p.1151-1164

2005

Volltextzugriff (PDF)

An analytic center cutting plane method for pseudomonotone variational inequalities

Operations research letters, 1997, Vol.20 (1), p.1-6

1997

Volltextzugriff (PDF)

Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach

Computers & operations research, 2004-04, Vol.31 (5), p.722

2004

Volltextzugriff (PDF)

Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method

Optimization methods & software, 2002-01, Vol.17 (5), p.805-867

2002

Volltextzugriff (PDF)

A two-cut approach in the analytic center cutting plane method

Mathematical methods of operations research (Heidelberg, Germany), 1999, Vol.49 (1), p.149-169

1999

Volltextzugriff (PDF)

Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming

Discrete Applied Mathematics, 1994-03, Vol.49 (1), p.3-23

1994

Volltextzugriff (PDF)

1 – 25 von 504

Menü

Weitere Dienste

Einstellungen

A primal-dual regularized interior-point method for semidefinite programming

Algorithms for Constrained Minimization of Smooth Nonlinear Functions

On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability

Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

Decomposition and Nondifferentiable Optimization with the Projective Algorithm

Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach

A cutting plane method from analytic centers for stochastic programming

Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method

Using central prices in the decomposition of linear programs

On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities

A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems

Long-step interior-point algorithms for a class of variational inequalities with monotone operators

Convergence of a simple subgradient level method

On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm

Cutting planes and column generation techniques with the projective algorithm

The Relaxation Method for Solving Systems of Linear Inequalities

Short Steps with Karmarkar’s Projective Algorithm for Linear Programming

Shallow, deep and very deep cuts in the analytic center cutting plane method

On the non-polynomiality of the relaxation method for systems of linear inequalities

Efficient Production-Distribution System Design

An analytic center cutting plane method for pseudomonotone variational inequalities

Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach

Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method

A two-cut approach in the analytic center cutting plane method

Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming

Suchergebnisse filtern