Cargando…

Interior point approach to linear, quadratic and convex programming: algorithms and complexity

Detalles Bibliográficos
Autor principal:	Hertog, D
Lenguaje:	eng
Publicado:	Springer 1994
Materias:	Mathematical Physics and Mathematics
Acceso en línea:	https://dx.doi.org/10.1007/978-94-011-1134-8 http://cds.cern.ch/record/1619841

Ejemplares similares

Optimal Quadratic Programming Algorithms
por: Dostal, Zdenek
Publicado: (2009)

An algorithm for general quadratic programming
por: Hashim, M H A
Publicado: (1998)

Interior point methods for linear optimization
por: Roos, Cornelis, et al.
Publicado: (2005)

Aspects of semidefinite programming: interior point algorithms and selected applications
por: Klerk, Etienne
Publicado: (2004)

Interior point algorithms: theory and analysis
por: Ye, Yinyu
Publicado: (2011)

Binary quadratic forms: an algorithmic approach
por: Buchmann, Johannes, et al.
Publicado: (2007)

Interior point methods of mathematical programming
por: Terlaky, Tamas
Publicado: (1996)

Interior point techniques in optimization: complementarity, sensitivity and algorithms
por: Jansen, Benjamin
Publicado: (1997)

Preprocessing for quadratic programming
por: Gould, N I M, et al.
Publicado: (2002)

Progress in mathematical programming: interior-point and related methods
por: Megiddo, Nimrod
Publicado: (1989)

Optimization for decision making: linear and quadratic models
por: Murty, Katta G
Publicado: (2010)

Quadratic Forms, Linear Algebraic Groups, and Cohomology
por: Colliot-Thélène, Jean-Louis, et al.
Publicado: (2010)

Algorithms for quadratic matrix and vector equations
por: Poloni, Federico
Publicado: (2011)

The quadratic assignment problem: theory and algorithms
por: Çela, Eranda
Publicado: (1998)

Convex analysis and minimization algorithms
por: Hiriart-Urruty, Jean-Baptiste, et al.
Publicado: (1993)

Theory of convex programming
por: Gol′steĭn, E G, et al.
Publicado: (1972)

Extensions of linear-quadratic control, optimization and matrix theory
por: Jacobson, David H
Publicado: (1977)

Strict convexity and complex strict convexity: theory and applications
por: Istratescu
Publicado: (1983)

Self-regularity: a new paradigm for primal-dual interior-point algorithms
por: Peng, Jimine, et al.
Publicado: (2002)

The projected subgradient algorithm in convex optimization
por: Zaslavski, Alexander J
Publicado: (2020)

Convex variational problems: linear, nearly linear and anisotropic growth conditions
por: Bildhauer, Michael
Publicado: (2003)

International Conference on Non-Linear Analysis and Convex Analysis
por: Takahashi, Wataru, et al.
Publicado: (1999)

Foundations of mathematical optimization: convex analysis without linearity
por: Pallaschke, Diethard, et al.
Publicado: (1997)

Locally convex spaces and linear partial differential equations
por: Treves, François
Publicado: (1967)

Complex convexity and analytic functionals
por: Andersson, Mats, et al.
Publicado: (2004)

A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints
por: Conn, A R, et al.
Publicado: (1996)

Quadratic forms and matrices: an introductory approach
por: Yefimov, N V
Publicado: (1964)

A guide to analytic extrapolations I A program for optimal extrapolation to interior points
por: Ciulli, M, et al.
Publicado: (1979)

Join geometries: a theory of convex sets and linear geometry
por: Prenowitz, Walter, et al.
Publicado: (1979)

Exposed points of convex sets and weak sequential convergence
por: Granirer, Edmond E
Publicado: (1972)

Linear programming: algorithms and applications
por: Vajda, S
Publicado: (1981)

Global optimization with non-convex constraints: sequential and parallel algorithms
por: Strongin, Roman G, et al.
Publicado: (2000)

Quadratic differentials
por: Strebel, Kurt
Publicado: (1984)

Quadratic algebras
por: Polishchuk, Alexander, et al.
Publicado: (2005)

Generalized bounds for convex multistage stochastic programs
por: Beckmann, M, et al.
Publicado: (2005)

Interior-point polynominal algoritms in convex programming
por: Nesterov, IU. E.
Publicado: (1994)

An interior-point $l_{1}$-penalty method for nonlinear optimization
por: Gould, N I M, et al.
Publicado: (2003)

A primal-dual trust-region algorithm for minimizing a non-convex function subject to general inequality and linear equality constraints
por: Conn, A R, et al.
Publicado: (1999)

Foundations of complex analysis in non locally convex spaces: function theory without convexity condition
por: Bayoumi, A
Publicado: (2003)

Quadratic programming and affine variational inequalities: a qualitative study
por: Lee, Gue Myung, et al.
Publicado: (2005)

Cannot write session to /tmp/vufind_sessions/sess_s2i825upjij550lbhaqqubghdc