scientific article
From MaRDI portal
Publication:4016509
zbMath0766.65053MaRDI QIDQ4016509
Publication date: 16 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items
Improved PHSS iterative methods for solving saddle point problems, A note on exploiting structure when using slack variables, The convergence of an interior-point method using modified search directions in final iterations, Some properties of the Hessian of the logarithmic barrier function, Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy, A primal-dual interior point method whose running time depends only on the constraint matrix, An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization, GMRES-Accelerated ADMM for Quadratic Objectives, A method of Euclidean centers, Trajectory-following methods for large-scale degenerate convex quadratic programming, Global optimization for the biaffine matrix inequality problem, The interior-point revolution in optimization: History, recent developments, and lasting consequences, Modified primal path-following scheme for the monotone variational inequality problem, SPMR: A Family of Saddle-Point Minimum Residual Solvers, Copula density estimation by finite mixture of parametric copula densities, Componentwise analysis of direct factorization of real symmetric and Hermitian matrices, Primal-dual methods for linear programming, Linear programming, complexity theory and elementary functional analysis, Handling constraints in optimal control with saturation functions and system extension, Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis, Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity, Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods, On quasi shift-splitting iteration method for a class of saddle point problems, A proximal interior point algorithm with applications to image processing, A primal-dual augmented Lagrangian, Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives, Accelerating the Uzawa Algorithm, Convex fuzzy \(k\)-medoids clustering, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds, On the Newton interior-point method for nonlinear programming problems, Inexact-restoration algorithm for constrained optimization, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Variants of the Uzawa method for three-order block saddle point problem, Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots, Uzawa-low method and preconditioned Uzawa-low method for three-order block saddle point problem, On the GTSOR-like Method for the Augmented systems, Bifurcation instability in linear elasticity with the constraint of local injectivity, Equivalent formulae for the supremum and stability of weighted pseudoinverses, Accelerating the shift-splitting iteration algorithm, A low-order block preconditioner for saddle point linear systems, FGMRES preconditioning by symmetric/skew-symmetric decomposition of generalized Stokes problems, Natural Preconditioning and Iterative Methods for Saddle Point Systems, Convergence of iterative methods for stabilized saddle-point problems, An interior-point method for fractional programs with convex constraints, Method of centers for minimizing generalized eigenvalues, Another look at linear programming for feature selection via methods of regularization, Deep unfolding of a proximal interior point method for image restoration, Long-step primal path-following algorithm for monotone variational inequality problems, Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics, A continuation method for (strongly) monotone variational inequalities, Unnamed Item, A new class of improved convex underestimators for twice continuously differentiable constrained NLPs, Symbiosis between linear algebra and optimization, Higher-order derivatives in linear and quadratic programming, Interior-point methods, The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors, Degeneracy in interior point methods for linear programming: A survey, Inertia-controlling factorizations for optimization algorithms, Two numerical methods for optimizing matrix stability
