A numerically stable dual method for solving strictly convex quadratic programs
From MaRDI portal
Publication:59165
DOI10.1007/bf02591962zbMath0537.90081WikidataQ94872283 ScholiaQ94872283MaRDI QIDQ59165
A. Idnani, D. Goldfarb, Ashok Udhawdas Idnani, Donald Goldfarb
Publication date: September 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)
Related Items
On the superlinear convergence of a trust region algorithm for nonsmooth optimization, Optimal control of radiating panels via sequential quadratic programming, Monotone B-Spline Smoothing for a Generalized Linear Model Response, Newton projection method as applied to assembly simulation, Weighted multiple blockwise imputation method for high-dimensional regression with blockwise missing data, Time-discretized variational formulation of non-smooth frictional contact, A unified mathematical programming formulation of strain driven and interior point algorithms for shakedown and limit analysis, Unnamed Item, A unified framework of constrained regression, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, Quadratic distances for capacity and bi-capacity approximation and identification, Active Set Methods with Reoptimization for Convex Quadratic Integer Programming, Sigmoid Data Fitting by Least Squares Adjustment of Second and Third Divided Differences, FUZZY MULTIPLE OBJECTIVE PROGRAMMING IN AN INTERVAL PIECEWISE REGRESSION MODEL, Test shape constraints in semiparametric model with Bernstein polynomials, Sequential Construction and Dimension Reduction of Gaussian Processes Under Inequality Constraints, A column generation method for inverse shortest path problems, Characterizing the SLOPE trade-off: a variational perspective and the Donoho-Tanner limit, New moderation methods of higher school certificate assessments: a case study of the New South Wales practice, Finite-dimensional approximation of Gaussian processes with linear inequality constraints and noisy observations, Convergence properties of Levenberg-Marquardt methods with generalized regularization terms, A dual decomposition of the closest point projection in incremental elasto‐plasticity using a mixed shell finite element, A New Rejection Sampling Method for Truncated Multivariate Gaussian Random Variables Restricted to Convex Sets, Penalized optimal scaling for ordinal variables with an application to international classification of functioning core sets, The Markowitz's mean-variance interpretation under the efficient market hypothesis in the context of critical recession periods, Forecasting mortality rates with a coherent ensemble averaging approach, Solving nonlinear programming problems with very many constraints, The relative formulation of the quadratic programming problem in the aircraft assembly modeling, Updating conjugate directions by the BFGS formula, On the elimination of inessential points in the smallest enclosing ball problem, INTERVAL PIECEWISE REGRESSION MODEL WITH AUTOMATIC CHANGE-POINT DETECTION BY QUADRATIC PROGRAMMING, Estimating transition coefficients for reconstructing coherent series of mortality by cause of Death, Approximation of Limit State Surfaces in Monotonic Monte Carlo Settings, with Applications to Classification, Local dependence estimation using semiparametric archimedean copulas, Hybrid metaheuristics for constrained portfolio selection problems, Efficient algorithms for computing the non and semi-parametric maximum likelihood estimates with panel count data, Conservative discretization of contact/impact problems for nearly rigid bodies, Two-stage estimation of inequality-constrained marginal linear models with longitudinal data, Design of smallest size two-dimensional linear-phase FIR filters with magnitude error constraint, Unnamed Item, Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems, Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming, Shape constrained smoothing using smoothing splines, A weighted gram-schmidt method for convex quadratic programming, Emulators for stochastic simulation codes, Positive numerical integration methods for chemical kinetic systems, Dual support method for solving convex quadratic programs, Modeling the Cholesky factors of covariance matrices of multivariate longitudinal data, Convex analysis in the semiparametric model with Bernstein polynomials, Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods, Simultaneous Small Sample Inference for Linear Combinations of Generalized Linear Model Parameters, Unnamed Item, Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves, ON THE CONSISTENCY OF REGRESSION‐BASED MONTE CARLO METHODS FOR PRICING BERMUDAN OPTIONS IN CASE OF ESTIMATED FINANCIAL MODELS, Optimal control of a turbulent fibre suspension flowing in a planar contraction, A semiparametric generalized ridge estimator and link with model averaging, On the Sensitivity of Least Squares Data Fitting by Nonnegative Second Divided Differences, Quadratic programming algorithms for obstacle problems, A Simple New Algorithm for Quadratic Programming with Applications in Statistics, Koopman operator method for solution of generalized aggregate data inverse problems, Solving norm constrained portfolio optimization via coordinate-wise descent algorithms, Application of the dual active set algorithm to quadratic network optimization, QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming, Tuning strategy for the proximity parameter in convex minimization, Experiments with successive quadratic programming algorithms, A note on forecasting Euro area inflation: leave-\(h\)-out cross validation combination as an alternative to model selection, An inexact restoration strategy for the globalization of the sSQP method, Block-iterative surrogate projection methods for convex feasibility problems, Primal and dual active-set methods for convex quadratic programming, Randomized algorithms for the separation of point sets and for solving quadratic programs, On solving the Lagrangian dual of integer programs via an incremental approach, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Generalization of effective conductance centrality for egonetworks, Minimum variance capacity identification, Piecewise linear approximations in nonconvex nonsmooth optimization, Optimization-based limiters for the spectral element method, Applying iterated mapping to the no-three-in-a-line problem, Nonlinear modeling and control approach to magnetic levitation ball system using functional weight RBF network-based state-dependent ARX model, Coupling traffic models on networks and urban dispersion models for simulating sustainable mobility strategies, Gaussian process emulators for computer experiments with inequality constraints, Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation, A new method for interpolating in a convex subset of a Hilbert space, FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming, The inverse parallel machine scheduling problem with minimum total completion time, Numerical integration on trimmed three-dimensional domains with implicitly defined trimming surfaces, Shape restricted nonparametric regression with Bernstein polynomials, Bootstrap confidence bands for the CDF using ranked-set sampling, A numerically stable least squares solution to the quadratic programming problem, High-order sequential simulation via statistical learning in reproducing kernel Hilbert space, A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization, Parameter identification in financial market models with a feasible point SQP algorithm, Solving dual problems using a coevolutionary optimization algorithm, A tolerant algorithm for linearly constrained optimization calculations, Estimation of the mean for spatially dependent data belonging to a Riemannian manifold, A linearly distributed lag estimator with \(r\)-convex coefficients, Robust clusterwise linear regression through trimming, LE\textsc{o}P\textsc{art}: a particle library for FE\textsc{ni}CS, Convex optimization techniques in compliant assembly simulation, Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods, Finite element analysis of nonsmooth contact, Estimating ordered parameters by linear programming, A general projection framework for constrained smoothing., A general trimming approach to robust cluster analysis, qpOASES: a parametric active-set algorithm for~quadratic programming, On an instance of the inverse shortest paths problem, Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs, Solution of projection problems over polytopes, Sensitivity analysis with \(\chi^2\)-divergences, District heating networks -- dynamic simulation and optimal operation, On fast trust region methods for quadratic models with linear constraints, A parallel quadratic programming method for dynamic optimization problems, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, An improved gradient projection-based decomposition technique for support vector machines, A cutting plane method for solving minimax problems in the complex plane, Minimal subfamilies and the probabilistic interpretation for modulus on graphs, Updating of conjugate direction matrices using members of Broyden's family, CMLS, A general method for calculating functions of fuzzy numbers, The nearest point problem in a polyhedral set and its extensions, A robust implementation of a sequential quadratic programming algorithm with successive error restoration, Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization, Multivariate nonparametric estimation of the Pickands dependence function using Bernstein polynomials, Node harvest, Active set algorithm for mathematical programs with linear complementarity constraints, An active index algorithm for the nearest point problem in a polyhedral cone, The sagitta method for solving linear programs, A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming, A fast design algorithm for elliptic-error and phase-error constrained LS 2-D FIR filters, A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings, qpmadr, An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints, Revisiting fitting monotone polynomials to data, A dual simplex-type algorithm for the smallest enclosing ball of balls, A note on applying the BCH method under linear equality and inequality constraints, A new penalty function algorithm for convex quadratic programming, Reducing bias in curve estimation by use of weights., Moment preserving constrained resampling with applications to particle-in-cell methods, An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set, A new technique for inconsistent QP problems in the SQP method, Factor and hybrid components for model-based clustering, MERLIN-3. 0. A multidimensional optimization environment, An exterior point polynomial-time algorithm for convex quadratic programming, Nonlinear model predictive control with aggregated constraints, ABS algorithms for linear equations and optimization, Shape-constrained estimation in functional regression with Bernstein polynomials, Semi-nonparametric estimation of the call-option price surface under strike and time-to-expiry no-arbitrage constraints, Bezier5YS and SHYqp: a general framework for generating data and for modeling symmetric and asymmetric orthotropic yield surfaces, Computation for latent variable model estimation: a unified stochastic proximal framework, Orthogonal and conjugate basis methods for solving equality constrained minimization problems, Resolving degeneracy in quadratic programming, A strictly improving linear programming Phase I algorithm, Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity, On the use of an inverse shortest paths algorithm for recovering linearly correlated costs, Application of sequential quadratic programming software program to an actual problem, Local convergence analysis for the REQP algorithm using conjugate basis matrices, Discretization methods for the solution of semi-infinite programming problems, Methods for convex and general quadratic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear programming codes. Information, tests, performance
- A computational method for the indefinite quadratic programming problem
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
- Quadratic Programming as an Extension of Classical Quadratic Maximization
- A Method of Solution for Quadratic Programs
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Simplex Method for Quadratic Programming
- Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme
- An example of cycling in a feasible point algorithm
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Numerically stable methods for quadratic programming
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints
- Large-scale linearly constrained optimization
- A stable method for solving certain constrained least squares problems
- Methods for Modifying Matrix Factorizations
- Simplicial methods for quadratic programming
- A Parametric Method for Semidefinite Quadratic Programs
- On the Numerical Solution of Constrained Least-Squares Problems
- A General Quadratic Programming Algorithm
