Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
From MaRDI portal
Publication:1653960
Recommendations
- Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints
- On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors
- Assessing the reliability of general-purpose inexact restoration methods
- A flexible inexact-restoration method for constrained optimization
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- A new line search inexact restoration approach for nonlinear programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Algorithm 813
- An inexact-restoration method for nonlinear bilevel programming problems
- Approximation algorithms for the Geometric Covering Salesman Problem
- Assessing the reliability of general-purpose inexact restoration methods
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Euler discretization and inexact restoration for optimal control
- Inexact restoration approach for minimization with inexact evaluation of the objective function
- Inexact restoration for Euler discretization of box-constrained optimal control problems
- Inexact restoration method for derivative-free optimization with smooth constraints
- Inexact spectral projected gradient methods on convex sets
- Inexact-restoration algorithm for constrained optimization
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- Local convergence of an inexact-restoration method and numerical experiments
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the Barzilai and Borwein choice of steplength for the gradient method
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Practical augmented Lagrangian methods for constrained optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
- Some NP-complete problems in quadratic and nonlinear programming
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The travelling salesman problem with neighbourhoods: MINLP solution
- Two-Point Step Size Gradient Methods
Cited in
(6)- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints
- Inexact-restoration algorithm for constrained optimization
- On the complexity of an inexact restoration method for constrained optimization
- A flexible inexact-restoration method for constrained optimization
- Inexact restoration for derivative-free expensive function minimization and applications
This page was built for publication: Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653960)
