A new technique for inconsistent QP problems in the SQP method
From MaRDI portal
Publication:1298765
DOI10.1007/BF01198402zbMath0964.90062OpenAlexW2066237909MaRDI QIDQ1298765
Publication date: 5 October 1999
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01198402
algorithmconvergencesequential quadratic programmingnonlinear programminginconsistent quadratic programming
Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)
Related Items
A superlinearly convergent hybrid algorithm for solving nonlinear programming, A continuous buffer allocation model using stochastic processes, Adjoint-based error control for the simulation and optimization of gas and water supply networks, The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning, Shape control of Bézier surfaces with iso-parametric monotone curvature constraints, Fast and reliable transient simulation and continuous optimization of large-scale gas networks, Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification, Capacity drop and traffic control for a second order traffic model, Hybrid pattern search and simulated annealing for fuzzy production planning problems, On the Influence of Constitutive Models on Shape Optimization for Artificial Blood Pumps, An overview of nonlinear optimization, W-methods in optimal control, A constrained sequential-lamination algorithm for the simulation of sub-grid microstructure in martensitic materials., Sensitivity of optimal shapes of artificial grafts with respect to flow parameters, Finite element analysis of nonsmooth contact, Optimization for a special class of traffic flow models: combinatorial and continuous approaches, An SQP method for minimization of locally Lipschitz functions with nonlinear constraints, A sequential quadratically constrained quadratic programming method of feasible directions, Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems, Numerical method for optimum motion of undulatory swimming plate in fluid flow, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, Optimization, Quantitative portfolio selection: using density forecasting to find consistent portfolios, Pricing general insurance with constraints, Solving constrained optimization problems using a novel genetic algorithm, A robust SQP method based on a smoothing lower order penalty function†, An active set sequential quadratic programming algorithm for nonlinear optimisation, HYBRID SIMULATED ANNEALING AND GENETIC ALGORITHMS FOR INDUSTRIAL PRODUCTION MANAGEMENT PROBLEMS, An SQP method for general nonlinear programs using only equality constrained subproblems, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, Microstructure evolution in the equal channel angular extrusion process, Algorithms for optimal signal set design, On cost function transformations for the reduction of uncertain model parameters' impact towards the optimal solutions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems
- An efficient algorithm for solving inequalities
- A globally convergent algorithm for nonlinearly constrained optimization problems
- New results on a class of exact augmented Lagrangians
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- Representations of quasi-Newton matrices and their use in limited memory methods
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
- A robust sequential quadratic programming method
- Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization
- Exact penalty function algorithm with simple updating of the penalty parameter
- A sequential quadratic programming method for potentially infeasible mathematical programs
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- Stability of the solution of definite quadratic programs
- An Algorithm for Large-Scale Quadratic Programming
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- A model algorithm for composite nondifferentiable optimization problems
- An Exact Penalization Viewpoint of Constrained Optimization
- An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization
- A Robust Trust Region Method for Constrained Nonlinear Programming Problems
- A set of geometric programming test problems and their solutions
- Numerically stable methods for quadratic programming
- Some examples of cycling in variable metric methods for constrained minimization
- On the Resolution of Linearly Constrained Convex Minimization Problems
