Pages that link to "Item:Q5958076"
From MaRDI portal
The following pages link to Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. (Q5958076):
Displaying 50 items.
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization (Q315505) (← links)
- Inexact restoration and adaptive mesh refinement for optimal control (Q380590) (← links)
- Inexact restoration method for minimization problems arising in electronic structure calculations (Q409270) (← links)
- Inexact restoration method for nonlinear optimization without derivatives (Q492056) (← links)
- An inexact restoration derivative-free filter method for nonlinear programming (Q520323) (← links)
- On approximate KKT condition and its extension to continuous variational inequalities (Q637544) (← links)
- An inexact-restoration method for nonlinear bilevel programming problems (Q839690) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Local convergence of an inexact-restoration method and numerical experiments (Q850815) (← links)
- Global convergence of slanting filter methods for nonlinear programming (Q932546) (← links)
- A new line search inexact restoration approach for nonlinear programming (Q975358) (← links)
- A filter inexact-restoration method for nonlinear programming (Q1024701) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization (Q1675558) (← links)
- An interior-point method for solving box-constrained underdetermined nonlinear systems (Q1763761) (← links)
- Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate. (Q1872927) (← links)
- Inexact restoration for Euler discretization of box-constrained optimal control problems (Q1949576) (← links)
- A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations (Q2019006) (← links)
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications (Q2122022) (← links)
- Inexact restoration for derivative-free expensive function minimization and applications (Q2122038) (← links)
- Inexact restoration with subsampled trust-region methods for finite-sum minimization (Q2191786) (← links)
- A penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)
- Non-monotone inexact restoration method for nonlinear programming (Q2191795) (← links)
- The demand adjustment problem via inexact restoration method (Q2196267) (← links)
- Assessing the reliability of general-purpose inexact restoration methods (Q2255712) (← links)
- Newton-type methods: a broader view (Q2260691) (← links)
- A flexible inexact-restoration method for constrained optimization (Q2346395) (← links)
- Sequential equality-constrained optimization for nonlinear programming (Q2374366) (← links)
- An inexact restoration strategy for the globalization of the sSQP method (Q2377163) (← links)
- Constrained derivative-free optimization on thin domains (Q2392122) (← links)
- Bilevel optimization with a multiobjective problem in the lower level (Q2424032) (← links)
- Global convergence of a general filter algorithm based on an efficiency condition of the step (Q2453360) (← links)
- Euler discretization and inexact restoration for optimal control (Q2471093) (← links)
- A trust-region SQP method without a penalty or a filter for nonlinear programming (Q2515095) (← links)
- A line search SQP method without a penalty or a filter (Q2516801) (← links)
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems (Q2655405) (← links)
- Inexact restoration approach for minimization with inexact evaluation of the objective function (Q2796018) (← links)
- On the sensitivity of a Euclidean projection (Q2940380) (← links)
- Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework (Q2943830) (← links)
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming (Q2970395) (← links)
- Local convergence of filter methods for equality constrained non-linear programming (Q3066927) (← links)
- On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors (Q4605701) (← links)
- Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration (Q4805935) (← links)
- A stochastic local search algorithm for constrained continuous global optimization (Q4929093) (← links)
- On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514) (← links)
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization (Q5219665) (← links)
- Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (Q5235099) (← links)
- On second-order optimality conditions for nonlinear programming (Q5426957) (← links)
- A filter algorithm: comparison with NLP solvers (Q5459749) (← links)
- On sequential optimality conditions for smooth constrained optimization (Q5894295) (← links)
