MINOS

swMATH5095MaRDI QIDQ17235

No author found.

Related Items (only showing first 100 items - show all)

Designing a superstructure for parametric search for optimal search spaces in non‐trivial optimization problems ⋮ Domain Decomposition for the SP_NSolver MINOS ⋮ SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization ⋮ The symmetric eigenvalue complementarity problem ⋮ A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization ⋮ On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints ⋮ A Revised Dual Projective Pivot Algorithm for Linear Programming ⋮ Gradient projection methods for quadratic programs and applications in training support vector machines ⋮ The interior-point revolution in optimization: History, recent developments, and lasting consequences ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computer Codes for the Analysis of Infeasible Linear Programs ⋮ Unnamed Item ⋮ Siting and sizing of facilities under probabilistic demands ⋮ Unnamed Item ⋮ Siting and sizing of facilities under probabilistic demands ⋮ The design and application of IPMLO. A FORTRAN library for linear optimization with interior point methods ⋮ Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming ⋮ Breast Cancer Diagnosis and Prognosis Via Linear Programming ⋮ Spectral estimates for high‐frequency sampled continuous‐time autoregressive moving average processes ⋮ Unnamed Item ⋮ Global optimization of explicit strong-stability-preserving Runge-Kutta methods ⋮ Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints ⋮ Monotonic Optimization: Branch and Cut Methods ⋮ Dual–primal algorithm for linear optimization ⋮ Unnamed Item ⋮ A systematic strategy for simultaneous adaptive \(hp\) finite element mesh modification using nonlinear programming ⋮ Assessment of several algorithms for multi-period market equilibrium models with geometric distributed lag demand ⋮ Global optimization of general non-convex problems with intermediate bilinear substructures ⋮ Erratum: A spring-embedding approach for the facility layout problem ⋮ The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization ⋮ Variable Selection and Model Building via Likelihood Basis Pursuit ⋮ Identification and control using Volterra models ⋮ Semidefinite relaxations of fractional programs via novel convexification techniques ⋮ Unnamed Item ⋮ Benchmarking optimization software with performance profiles. ⋮ The NOP-2 modeling language for nonlinear programming ⋮ Unnamed Item ⋮ Massive data discrimination via linear support vector machines ⋮ Copositivity tests based on the linear complementarity problem ⋮ Computing Wardropian equilibria in a complementarity framework ⋮ Unnamed Item ⋮ A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints ⋮ An Interior Point Method for Bordered Block-Diagonal Linear Programs ⋮ Global Optimization and Constraint Satisfaction ⋮ Unnamed Item ⋮ A Profit-maximizing Plant-loading Model with Demand Fill-rate Constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming ⋮ Solving staircase linear programs by the simplex method, 2: Pricing ⋮ Comments on: Algorithms for linear programming with linear complementarity constraints ⋮ Linear Programming Computation ⋮ A Practical Interior-Point Method for Convex Programming ⋮ Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming ⋮ Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints ⋮ An optimization algorithm for a distributed-loop model of an avian urine concentrating mechanism ⋮ A globally convergent penalty-free method for optimization with equality constraints and simple bounds ⋮ Methods for a network design problem in solar power systems ⋮ Effective reformulations of the truss topology design problem ⋮ An inexact-restoration method for nonlinear bilevel programming problems ⋮ Global minimization of indefinite quadratic problems ⋮ Computational experience with a dual affine variant of Karmarkar's method for linear programming ⋮ Control parametrization: a unified approach to optimal control problems with general constraints ⋮ A linear programming decomposition focusing on the span of the nondegenerate columns ⋮ On the quadratic eigenvalue complementarity problem ⋮ Formulating an objective for an economy ⋮ On constrained optimization problems with nonsmooth cost functionals ⋮ Differential evolution methods based on local searches ⋮ A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints ⋮ An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems ⋮ A planar single facility location and border crossing problem ⋮ Fast non-overlapping Schwarz domain decomposition methods for solving the neutron diffusion equation ⋮ Congested network flows: Time-varying demands and start-time policies ⋮ Controlled dual perturbations for posynomial programs ⋮ Recent developments in constrained optimization ⋮ An analysis of an available set of linear programming test problems ⋮ Parallel search algorithms in global optimization ⋮ A theoretical analysis of the cross-nested logit model ⋮ A note on solving quadratic programs using mixed-integer programming ⋮ Making progress during a stall in the simplex algorithm ⋮ Parallel quasi-Newton methods for unconstrained optimization ⋮ A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ Quadratically constrained minimum cross-entropy analysis ⋮ Using concave envelopes to globally solve the nonlinear sum of ratios problem ⋮ Iterative linear programming solution of convex programs ⋮ Bundle-based decomposition: Conditions for convergence ⋮ Implementing proximal point methods for linear programming ⋮ Solving a class of LP problems with a primal-dual logarithmic barrier method ⋮ Modelling network constrained economic dispatch problems ⋮ On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers ⋮ A DC programming approach for solving the symmetric eigenvalue complementarity problem ⋮ A projected-gradient interior-point algorithm for complementarity problems ⋮ A primal-dual augmented Lagrangian ⋮ A heuristic procedure for solving the quadratic assignment problem ⋮ Large scale nonlinear deterministic and stochastic optimization: Formulations involving simulation of subsurface contamination ⋮ MSLiP: A computer code for the multistage stochastic linear programming problem ⋮ A survey of dynamic network flows ⋮ Scaling linear optimization problems prior to application of the simplex method

This page was built for software: MINOS