scientific article

Stephen G. Nash, Ariela Sofer, Igor A. Griva

Publication date: 31 October 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

unconstrained optimization nonlinear optimization interior-point methods Linear Programming

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Interior-point methods (90C51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

A survey of nonlinear robust optimization, Efficient optimization of the likelihood function in Gaussian process modelling, A classification problem of credit risk rating investigated and solved by optimisation of the ROC curve, Predictive analytics model for healthcare planning and scheduling, A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks, On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices, A robust topology optimisation for wideband structures in acoustic-elastodynamic coupled fields, Reservoir description with integrated multiwell data using two-dimensional wavelets, A new global optimization technique by auxiliary function method in a directional search, An ADMM-based algorithm for stabilizing distributed model predictive control without terminal cost and constraint, A derivative-free algorithm for linearly constrained optimization problems, A Fourier-coefficient based solution of an optimal control problem in quantum chemistry, Empirical likelihood ratio in penalty form and the convex hull problem, A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization, Covering a set of points with a minimum number of equal disks via simulated annealing, A fast and efficient estimation of the parameters of a model of accident frequencies via an MM algorithm, nlTGCR: A Class of Nonlinear Acceleration Procedures Based on Conjugate Residuals, An efficient nonmonotone method for state-constrained elliptic optimal control problems, A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming, An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department, A trust-region approach for computing Pareto fronts in multiobjective optimization, Numerical algorithms and simulations of boundary dynamic control for optimal mixing in unsteady Stokes flows, Finding all multiple stable fixpoints of \(n\)-species Lotka-Volterra competition models, Adaptive constraint reduction for convex quadratic programming, Unnamed Item, Unnamed Item, Subsampled Hessian Newton Methods for Supervised Learning, Means and covariance functions for geostatistical compositional data: an axiomatic approach, Stability advances in robust portfolio optimization under parallelepiped uncertainty, Hopf bifurcation analysis and ultimate bound estimation of a new 4-D quadratic autonomous hyper-chaotic system, Tropical principal component analysis and its application to phylogenetics, Improving and benchmarking of algorithms for \(\Gamma \)-maximin, \( \Gamma \)-maximax and interval dominance, On dynamically generating relevant elementary flux modes in a metabolic network using optimization, On solving large-scale limited-memory quasi-Newton equations, Intrinsic tetrahedron formation of reduced attitude, On solving L-SR1 trust-region subproblems, Discrete-space agglomeration model with social interactions: multiplicity, stability, and continuous limit of equilibria, A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization, Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation, Optimality conditions for maximizing a function over a polyhedron, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, Evaluating betting odds and free coupons using desirability, Multigrid renormalization, A novel neurodynamic reaction-diffusion model for solving linear variational inequality problems and its application, The explicit solution of the profit maximization problem with box-constrained inputs, A local maximizer for lattice width of 3-dimensional hollow bodies, Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization, Improvement of Karush-Kuhn-Tucker conditions under uncertainties using robust decision making indexes, Sparse randomized shortest paths routing with Tsallis divergence regularization, A design technique for fast sampled-data nonlinear model predictive control with convergence and stability results, Improving and benchmarking of algorithms for decision making with lower previsions, Projection onto a Polyhedron that Exploits Sparsity, Hiding Communication Delays in Contention-Free Execution for SPM-Based Multi-Core Architectures, Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach, A nonmonotone line search for the LBFGS method in parabolic optimal control problems, Teaching students nonlinear programming with computer algebra system, On image restoration from random sampling noisy frequency data with regularization, Theory of functional connections applied to quadratic and nonlinear programming under equality constraints, A nonlinear state marginal price vector model for the task of business valuation. A case study: the dimensioning of IT-service companies under nonlinear synergy effects, A simple and useful regression model for fitting count data, Unnamed Item, Optimal control of stochastic hybrid system with jumps: a numerical approximation, The Role of Asymptomatic Infections in the COVID-19 Epidemic via Complex Networks and Stability Analysis, Optimal control of viscous Burgers equation via an adaptive nonmonotone Barzilai–Borwein gradient method