A first-order regularized approach to the order-value optimization problem
From MaRDI portal
Cites work
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Complexity and performance of an augmented Lagrangian algorithm
- Cubic regularization of Newton method and its global performance
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- Generalized order-value optimization
- Global order-value optimization by means of a multistart harmonic oscillator tunneling strategy
- Low order-value optimization and applications
- Nonlinear-programming reformulation of the order-value optimization problem
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- Optimality condition and complexity of order-value optimization problems and low order-value optimization problems
- Order-value optimization: formulation and solution by means of a primal Cauchy method
- Practical augmented Lagrangian methods for constrained optimization
- Quais-Newton methods for order-value optimization and value-at-risk calculations
- Testing Unconstrained Optimization Software
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
This page was built for publication: A first-order regularized approach to the order-value optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950989)
