scientific article
From MaRDI portal
Publication:3236242
zbMath0072.37601MaRDI QIDQ3236242
A. J. Goldman, Albert W. Tucker
Publication date: 1956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (78)
Duale Optimierungsaufgaben und Sattelpunktsätze ⋮ Limiting behavior of weighted central paths in linear programming ⋮ The use of the optimal partition in a linear programming solution for postoptimal analysis ⋮ The practical behavior of the homogeneous self-dual formulations in interior point methods ⋮ Asymptotic convergence in a generalized predictor-corrector method ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ Solving multiple criteria problems by interactive decomposition ⋮ Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution ⋮ Limit laws for empirical optimal solutions in random linear programs ⋮ Minmax and duality in nonlinear programming ⋮ Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ A general parametric analysis approach and its implication to sensitivity analysis in interior point methods ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ A geometrie representation for pairs of dual quadratic or linear programs ⋮ The strict complementarity in linear fractional optimization ⋮ Strong duality and minimal representations for cone optimization ⋮ An orderfield property for stochastic games when one player controls transition probabilities ⋮ An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints ⋮ Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs ⋮ Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming ⋮ Revisiting degeneracy, strict feasibility, stability, in linear programming ⋮ Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I) ⋮ A polynomial arc-search interior-point algorithm for convex quadratic programming ⋮ Unnamed Item ⋮ Maximum-Minimum Sätze über Graphen ⋮ A complementarity partition theorem for multifold conic systems ⋮ Lösung eines speziellen linearen Programms, z. B. für Kostenvergleichsprobleme ⋮ Unnamed Item ⋮ Identifying the optimal partition in convex quadratic programming ⋮ Homogeneous programming and symmetrization ⋮ On the uniqueness of optimal strategies in symmetric matrix games ⋮ On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery ⋮ Minimum principle sufficiency ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ On the finite convergence of interior-point algorithms for linear programming ⋮ Convergence behavior of interior-point algorithms ⋮ Über reguläre Kettengruppen ⋮ Duality theorems for convex functions ⋮ Generation of degenerate linear programming problems ⋮ An easy way to teach interior-point methods. ⋮ Convergence of the homotopy path for a full-Newton step infeasible interior-point method ⋮ The asymptotic optimal partition and extensions of the nonsubstitution theorem ⋮ Conic formulation for \(l_p\)-norm optimization ⋮ Unifying optimal partition approach to sensitivity analysis in conic optimization ⋮ Two simple proofs for analyticity of the central path in linear programming. ⋮ A saddlepoint theorem for self-dual linear systems ⋮ On the uncertainties transmitted from premises to conclusions in deductive inferences ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ A rounding procedure for semidefinite optimization ⋮ On the convergence of primal-dual interior-point methods with wide neighborhoods ⋮ Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces ⋮ Duality in nonlinear programming and the minimax theorem ⋮ Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs) ⋮ Error bounds for nondegenerate monotone linear complementarity problems ⋮ On the convergence rate of Newton interior-point methods in the absence of strict complementarity ⋮ An economic interpretation of duality in linear programming ⋮ On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method ⋮ Theory of majority decision elements ⋮ Partitioning multiple objective optimal solutions with applications in radiotherapy design ⋮ On duality for real and complex programming problems ⋮ Existence theory for the complex linear complementarity problem ⋮ Sensitivity analysis in linear programming: Just be careful! ⋮ Lineare Programme und allgemeine Vertretersysteme ⋮ Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ Ordered Field Property for Semi-Markov Games when One Player Controls Transition Probabilities and Transition Times ⋮ Sensitivity analysis in linear optimization: invariant support set intervals ⋮ Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem ⋮ Pivot versus interior point methods: Pros and cons ⋮ Degeneracy in interior point methods for linear programming: A survey ⋮ Dualität bei konvexen Optimierungs-(Programmierungs-)Aufgaben ⋮ On polyhedral extension of some LP theorems ⋮ The theory of linear programming:skew symmetric self-dual problems and the central path* ⋮ Finding an interior point in the optimal face of linear programs ⋮ Implied constraints and a unified theory of duality in linear and nonlinear programming ⋮ Polyhedral extensions of some theorems of linear programming ⋮ Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
This page was built for publication:
