filterSQP
From MaRDI portal
Software:16893
swMATH4725MaRDI QIDQ16893FDOQ16893
Author name not available (Why is that?)
Cited In (58)
- Linear Huber M-estimator under ellipsoidal data uncertainty
- Title not available (Why is that?)
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- An augmented Lagrangian filter method
- Numerical methods for large-scale nonlinear optimization
- A computational framework for image-based constrained registration
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Lift-and-project cuts for convex mixed integer nonlinear programs
- An algorithmic framework for convex mixed integer nonlinear programs
- Gap-free computation of Pareto-points by quadratic scalarizations
- Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming
- Conflict Analysis for MINLP
- Nonlinear optimization with GAMS /LGO
- A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems
- A line search exact penalty method using steering rules
- Sequential penalty quadratic programming filter methods for nonlinear programming
- Optimization of workcell layouts in a mixed-model assembly line environment
- Title not available (Why is that?)
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- A nonmonotone filter method for nonlinear optimization
- Solving large MINLPs on computational grids
- Classification model selection via bilevel programming
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem
- CUTEr and SifDec
- Title not available (Why is that?)
- Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets
- Strong-branching inequalities for convex mixed integer nonlinear programs
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- TACO: a toolkit for AMPL control optimization
- Minotaur: a mixed-integer nonlinear optimization toolkit
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming
- Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control
- A trust region filter method for general non-linear programming
- Erratum to: ``Nonlinear programming without a penalty function or a filter
- Solving quadratic programs to high precision using scaled iterative refinement
- A server for automated performance analysis of benchmarking data
- A projection-filter method for solving nonlinear complementarity problems
- Concrete Structure Design using Mixed-Integer Nonlinear Programming with Complementarity Constraints
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
- Title not available (Why is that?)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- SQP algorithms for solving Toeplitz matrix approximation problem
- Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
- A sequential cutting plane algorithm for solving convex NLP problems
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
- Extremal problems for convex polygons
This page was built for software: filterSQP