Nonlinear programming and nonsmooth optimization by successive linear programming
From MaRDI portal
Publication:2277149
Recommendations
Cites work
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Local properties of algorithms for minimizing nonsmooth composite functions
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Nonlinear programming via an exact penalty function: Global analysis
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
Cited in
(30)- An active set method for general linear problem subject to box constraints
- The Sequential Quadratic Programming Method
- Dynamic evacuation routes for personnel on a naval ship
- An \(\mathrm S\ell _1 \mathrm{LP}\)-active set approach for feasibility restoration in power systems
- A proximal method for composite minimization
- An augmented Lagrangian filter method
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- Primal interior-point method for large sparse minimax optimization
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- Traces and Emergence of Nonlinear Programming
- Linear-programming approach to nonconvex variational problems
- Nonlinear one-parametric bottleneck linear programming
- Corrected sequential linear programming for sparse minimax optimization
- Point-Based Set-Valued Approximations, C -Differential Operators and Applications
- Solving highly nonlinear convex separable programs using successive approximation
- On the use of piecewise linear models in nonlinear programming
- scientific article; zbMATH DE number 3920209 (Why is no real title available?)
- Sequential linearization method for bound-constrained mathematical programs with complementarity constraints
- An inexact first-order method for constrained nonlinear optimization
- Trust-region interior-point method for large sparsel1optimization
- MPEC methods for bilevel optimization problems
- scientific article; zbMATH DE number 4121777 (Why is no real title available?)
- scientific article; zbMATH DE number 3918115 (Why is no real title available?)
- A projected conjugate gradient method for sparse minimax problems
- scientific article; zbMATH DE number 7086992 (Why is no real title available?)
- Successive linearization methods for nonlinear semidefinite programs
- Successive linear programming for ratio goal problems
- An Improved Successive Linear Programming Algorithm
- Steering exact penalty methods for nonlinear programming
- On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming
This page was built for publication: Nonlinear programming and nonsmooth optimization by successive linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277149)
