Steering exact penalty methods for nonlinear programming
From MaRDI portal
Recommendations
Cites work
- A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
- A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
- A Penalty Function Method Converging Directly to a Constrained Optimum
- A Robust Trust Region Method for Constrained Nonlinear Programming Problems
- A trust region algorithm for equality constrained optimization
- An Exact Potential Method for Constrained Maxima
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Automatic decrease of the penalty parameter in exact penalty function methods
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Constrained Optimization Using a Nondifferentiable Penalty Function
- Exact penalty functions in nonlinear programming
- Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Interior-point algorithms, penalty methods and equilibrium problems
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Non-Linear Programming Via Penalty Functions
- Nonlinear programming and nonsmooth optimization by successive linear programming
- Nonlinear programming without a penalty function.
- Numerical Optimization
- On the convergence of a new trust region algorithm
- On the Convergence of Successive Linear-Quadratic Programming Algorithms
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Cited in
(39)- Automatic decrease of the penalty parameter in exact penalty function methods
- On the use of piecewise linear models in nonlinear programming
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates
- A local search method for optimization problem with d.c. inequality constraints
- Problems related to estimating the coefficients of exact penalty functions
- A penalty-interior-point algorithm for nonlinear constrained optimization
- Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
- An interior point method for nonlinear programming with infeasibility detection capabilities
- A robust combined trust region-line search exact penalty projected structured scheme for constrained nonlinear least squares
- An exact penalty-Lagrangian approach for large-scale nonlinear programming
- Derivative-free nonlinear optimization filter simplex
- Inexact sequential quadratic optimization with penalty parameter updates within the QP solver
- Decentralized Cooperative Optimization for Multi-criteria Decision Making
- Derivative-free optimization and filter methods to solve nonlinear constrained problems
- A line search exact penalty method using steering rules
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- An adaptive augmented Lagrangian method for large-scale constrained optimization
- On a solving bilevel d.c.-convex optimization problems
- Scalable nonlinear programming via exact differentiable penalty functions and trust-region Newton methods
- MPEC methods for bilevel optimization problems
- An inexact first-order method for constrained nonlinear optimization
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
- Exact penalization of generalized Nash equilibrium problems
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- An interior-point piecewise linear penalty method for nonlinear programming
- A self-adaptive penalty approach for nonlinear programming.
- A line search exact penalty method with bi-object strategy for nonlinear constrained optimization
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints
- Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization
- Switching stepsize strategies for sequential quadratic programming
- Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
- Convergence analysis and competitive numerical results of a trust region-line search projected exact penalty algorithm
- Method of quasidifferential descent in the problem of bringing a nonsmooth system from one point to another
- A natural SQP method with potentially infeasible subproblems for nonlinear optimization
- A unified funnel restoration SQP algorithm
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
- Global convergence of a robust filter SQP algorithm
This page was built for publication: Steering exact penalty methods for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3539789)
