filterSQP

swMATH4725MaRDI QIDQ16893

No author found.

Related Items (58)

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

This page was built for software: filterSQP