Pages that link to "Item:Q4162963"

The following pages link to Large-scale linearly constrained optimization (Q4162963):

Displaying 50 items.

• Optimal management of naturally regenerating uneven-aged forests (Q1752273) (← links)
• An implementation of Newton-like methods on nonlinearly constrained networks (Q1765533) (← links)
• Reformulation descent applied to circle packing problems (Q1772872) (← links)
• Parameter estimation in stochastic scenario generation systems (Q1806616) (← links)
• Analogy and duality of texture analysis by harmonics or indicators (Q1891298) (← links)
• A presentation of GAMS for DEA (Q1919213) (← links)
• Inexact-restoration algorithm for constrained optimization (Q1973486) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (Q2358024) (← links)
• Sequential equality-constrained optimization for nonlinear programming (Q2374366) (← links)
• Maximum urine concentrating capability in a mathematical model of the inner medulla of the rat kidney (Q2380835) (← links)
• Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403) (← links)
• Approximate subgradient methods for nonlinearly constrained network flow problems (Q2499376) (← links)
• A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems (Q2638951) (← links)
• Computational aspects of prospect theory with asset pricing applications (Q2642595) (← links)
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
• Improved primal simplex: a more general theoretical framework and an extended experimental analysis (Q2802253) (← links)
• Truncated-Newton algorithms for large-scale unconstrained optimization (Q3037163) (← links)
• Interior-point methods for linear programming: a review (Q3150491) (← links)
• Second order algorithms for the posynomial geometric programming dual, part I: Analysis (Q3205030) (← links)
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems (Q3221769) (← links)
• Theoretical framework for the analysis of linearly constrained convex programs (Q3328294) (← links)
• An algorithm for nonlinear programs over Cartesian product sets (Q3348713) (← links)
• Estimation of systems of equations subject to curvature constraints (Q3350618) (← links)
• On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints (Q3361814) (← links)
• Optimization over the efficient set using an active constraint approach (Q3363070) (← links)
• Automatic Minimal-Height Table Layout (Q3458745) (← links)
• Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision (Q3462312) (← links)
• Approximate Subgradient Methods for Lagrangian Relaxations on Networks (Q3557823) (← links)
• Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
• Procedures for optimization problems with a mixture of bounds and general linear constraints (Q3675917) (← links)
• Dealing with degeneracy in reduced gradient algorithms (Q3691433) (← links)
• Optimization of the domain in elliptic problems by the dual finite element method (Q3694608) (← links)
• A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
• A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
• On optimal shape design of systems governed by mixed Dirichlet‐Signorini boundary value problems (Q3739778) (← links)
• Optimal design of efficient acoustic antenna arrays (Q3785478) (← links)
• M.D.I. estimation via unconstrained convex programming (Q3878509) (← links)
• Evaluating computational efficiency: A stochastic approach (Q3951477) (← links)
• Subgradient optimization applied to a discrete nonlinear problem in engineering design (Q3968774) (← links)
• A quadratic programming algorithm for large and sparse problems (Q3978055) (← links)
• Convex stochastic programmes with simple recourse (Q4197630) (← links)
• Optimal designs for simultaneous item estimation (Q4378954) (← links)
• On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
• An algorithm for hierarchical optimization of large-scale problems with nested structure (Q4745631) (← links)
• (Q5020878) (← links)
• Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints (Q5026840) (← links)
• 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 (Q5031804) (← links)
• Spectral estimates for high‐frequency sampled continuous‐time autoregressive moving average processes (Q5397971) (← links)
• Convergence properties of a class of reduced gradient algorithms in linearly constrained minimization (Q5750732) (← links)