A new technique for inconsistent QP problems in the SQP method
From MaRDI portal
Publication:1298765
DOI10.1007/BF01198402zbMATH Open0964.90062OpenAlexW2066237909MaRDI QIDQ1298765FDOQ1298765
Authors: P. Spellucci 
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
Recommendations
convergencenonlinear programmingsequential quadratic programmingalgorithminconsistent quadratic programming
Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Numerically stable methods for quadratic programming
- A numerically stable dual method for solving strictly convex quadratic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representations of quasi-Newton matrices and their use in limited memory methods
- A Robust Trust Region Method for Constrained Nonlinear Programming Problems
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- Exact penalty function algorithm with simple updating of the penalty parameter
- An Exact Penalization Viewpoint of Constrained Optimization
- Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization
- A set of geometric programming test problems and their solutions
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- An Algorithm for Large-Scale Quadratic Programming
- Title not available (Why is that?)
- An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization
- A robust sequential quadratic programming method
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- Title not available (Why is that?)
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Stability of the solution of definite quadratic programs
- Title not available (Why is that?)
- 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
- On the Resolution of Linearly Constrained Convex Minimization Problems
- A model algorithm for composite nondifferentiable optimization problems
- Title not available (Why is that?)
- A globally convergent algorithm for nonlinearly constrained optimization problems
- Some examples of cycling in variable metric methods for constrained minimization
- A sequential quadratic programming method for potentially infeasible mathematical programs
- New results on a class of exact augmented Lagrangians
- An efficient algorithm for solving inequalities
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems
Cited In (35)
- Hybrid simulated annealing and genetic algorithms for industrial production management problems
- An SQP method for general nonlinear programs using only equality constrained subproblems
- Numerical method for optimum motion of undulatory swimming plate in fluid flow
- A practical update criterion for SQP method
- Adjoint-based error control for the simulation and optimization of gas and water supply networks
- Sensitivity of optimal shapes of artificial grafts with respect to flow parameters
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- Microstructure evolution in the equal channel angular extrusion process
- On cost function transformations for the reduction of uncertain model parameters' impact towards the optimal solutions
- Shape control of Bézier surfaces with iso-parametric monotone curvature constraints
- A robust SQP method based on a smoothing lower order penalty function†
- Quantitative portfolio selection: using density forecasting to find consistent portfolios
- Trade-off between power extraction maximisation and fatigue reduction in wind farms via second-order sliding mode control and min-max optimisation
- A superlinearly convergent hybrid algorithm for solving nonlinear programming
- Solving constrained optimization problems using a novel genetic algorithm
- Hybrid pattern search and simulated annealing for fuzzy production planning problems
- Finite element analysis of nonsmooth contact
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- W-methods in optimal control
- Algorithms for optimal signal set design
- A sequential quadratically constrained quadratic programming method of feasible directions
- An overview of nonlinear optimization
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- Optimization
- Optimization for a special class of traffic flow models: combinatorial and continuous approaches
- Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems
- Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification
- Capacity drop and traffic control for a second order traffic model
- The convex feasible set algorithm for real time optimization in motion planning
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Pricing general insurance with constraints
- A continuous buffer allocation model using stochastic processes
- Fast and reliable transient simulation and continuous optimization of large-scale gas networks
- On the influence of constitutive models on shape optimization for artificial blood pumps
- A constrained sequential-lamination algorithm for the simulation of sub-grid microstructure in martensitic materials.
Uses Software
This page was built for publication: A new technique for inconsistent QP problems in the SQP method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1298765)
