Large-scale linearly constrained optimization

From MaRDI portal

Publication:4162963

Jump to:navigation, search

DOI10.1007/BF01588950zbMath0383.90074OpenAlexW2049421260MaRDI QIDQ4162963

Michael A. Saunders, Bruce A. Murtagh

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01588950

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items

Computing minimum-volume enclosing ellipsoids, A local MM subspace method for solving constrained variational problems in image recovery, A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization, A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity, Adding variables to quasi-newton Hessian approximations, A subgradient-based optimization for reservois system management, A nonhierarchical brand switching model for inferring market structure, Subgradient optimization applied to a discrete nonlinear problem in engineering design, A hybrid algorithm for solving convex separable network flow problems, A projection method for \(l_ p\) norm location-allocation problems, Implementation and analysis of alternative algorithms for generalized shortest path problems, A note on exploiting structure when using slack variables, Experiments with successive quadratic programming algorithms, Pseudoconvex optimization for a special problem of paint industry, Sequential equality-constrained optimization for nonlinear programming, Analogy and duality of texture analysis by harmonics or indicators, The use of squared slack variables in nonlinear second-order cone programming, A Z-simplex algorithm with partial updates, Maximum urine concentrating capability in a mathematical model of the inner medulla of the rat kidney, A linear programming decomposition focusing on the span of the nondegenerate columns, Automatic Minimal-Height Table Layout, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision, Computational aspects of prospect theory with asset pricing applications, An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems, Convex preference cone-based approach for many objective optimization problems, A relaxed version of Karmarkar's method, A regularized decomposition method for minimizing a sum of polyhedral functions, Recent developments in constrained optimization, On optimal shape design of systems governed by mixed Dirichlet‐Signorini boundary value problems, An application of the finite element method to maximum entropy tomographic image reconstruction, Second order algorithms for the posynomial geometric programming dual, part I: Analysis, A presentation of GAMS for DEA, Two-phase model algorithm with global convergence for nonlinear programming, CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems, Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., Computational advances in polynomial optimization: RAPOSa, a freely available global solver, An algorithm for linearly constrained nonlinear programming problems, Canonical bases in linear programming, On large scale nonlinear network optimization, Optimal design of efficient acoustic antenna arrays, Real options valuation of forest plantation investments in Brazil, A heuristic procedure for solving the quadratic assignment problem, A nonlinear optimization package for long-term hydrothermal coordination., Parallel arc-allocation algorithms for optimizing generalized networks, Unnamed Item, A least-distance programming procedure for minimization problems under linear constraints, Inexact-restoration algorithm for constrained optimization, Spectral estimates for high‐frequency sampled continuous‐time autoregressive moving average processes, Approximate Subgradient Methods for Lagrangian Relaxations on Networks, On Regularization and Active-set Methods with Complexity for Constrained Optimization, On the covering multiplicity of lattices, George B. Dantzig and systems optimization, Optimal designs for simultaneous item estimation, Gauss-Seidel-Newton-Armijo approach for minimization problems on the non- negative orthant. Application to spatial price equilibrium problems, Optimal management of naturally regenerating uneven-aged forests, An algorithm for linearly constrained programs with a partly linear objective function, A numerically stable dual method for solving strictly convex quadratic programs, Theoretical framework for the analysis of linearly constrained convex programs, An implementation of Newton-like methods on nonlinearly constrained networks, Truncated-Newton algorithms for large-scale unconstrained optimization, An efficient method for nonlinearly constrained networks, Reformulation descent applied to circle packing problems, Convergence properties of a class of reduced gradient algorithms in linearly constrained minimization, Unnamed Item, An algorithm for nonlinear programs over Cartesian product sets, Approximate subgradient methods for nonlinearly constrained network flow problems, Estimation of systems of equations subject to curvature constraints, QPLIB: a library of quadratic programming instances, On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints, Optimization over the efficient set using an active constraint approach, M.D.I. estimation via unconstrained convex programming, Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis, Optimal power split in a hybrid electric vehicle using direct transcription of an optimal control problem, Optimization of the domain in elliptic problems by the dual finite element method, Simulation-based approach to estimation of latent variable models, Parameter estimation in stochastic scenario generation systems, Linearly constrained estimation by mathematical programming, Optimization with staircase structure: An application to generation scheduling, A nonlinear optimization methodology for VLSI fixed-outline floorplanning, An implementation of linear and nonlinear multicommodity network flows, Convex stochastic programmes with simple recourse, Large-scale linear programming: Geometry, working bases and factorizations, A general convergence theorem for the reduced gradient method, An algorithm for hierarchical optimization of large-scale problems with nested structure, Estimation of the optimal constants and the thickness of thin films using unconstrained optimization, On the first-order estimation of multipliers from Kuhn-Tucker systems, Procedures for optimization problems with a mixture of bounds and general linear constraints, On diagonally-preconditioning the 2-step BFGS method with accumulated steps for linearly constrained nonlinear programming, On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming, New labeling procedures for the basis graph in generalized networks, A sequential quadratic programming-based algorithm for the optimization of gas networks, Evaluating computational efficiency: A stochastic approach, On duality for entropy constrained programs, Performance evaluation of independent superbasic sets on nonlinear replicated networks, Dealing with degeneracy in reduced gradient algorithms, Decomposition method of descent for minimizing the sum of convex nonsmooth functions, Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints, Analysis and implementation of a dual algorithm for constrained optimization, Interior-point methods for linear programming: a review

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4162963&oldid=17979446"