Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
From MaRDI portal
Publication:1653960
zbMATH Open1392.90104MaRDI QIDQ1653960FDOQ1653960
Authors: E. G. Birgin, Rafael D. Lobato, J. M. Martínez 
Publication date: 7 August 2018
Published in: Bulletin of Computational Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://drive.google.com/open?id=0B5GyVVQ6O030b1pUNGRFNFFFLVk
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
- Algorithm 813
- Practical augmented Lagrangian methods for constrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Title not available (Why is that?)
- Some NP-complete problems in quadratic and nonlinear programming
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Title not available (Why is that?)
- An inexact-restoration method for nonlinear bilevel programming problems
- Solving mixed integer nonlinear programs by outer approximation
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Inexact-restoration algorithm for constrained optimization
- 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
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- A new line search inexact restoration approach for nonlinear programming
- Euler discretization and inexact restoration for optimal control
- The travelling salesman problem with neighbourhoods: MINLP solution
- Approximation algorithms for the Geometric Covering Salesman Problem
- Inexact spectral projected gradient methods on convex sets
- Inexact restoration for Euler discretization of box-constrained optimal control problems
- Inexact restoration method for derivative-free optimization with smooth constraints
- Local convergence of an inexact-restoration method and numerical experiments
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Inexact restoration approach for minimization with inexact evaluation of the objective function
- Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints
- Assessing the reliability of general-purpose inexact restoration 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
Uses Software
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)
