We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-20 of 198 results
  1. Inexact stochastic mirror descent for two-stage nonlinear stochastic programs

    We introduce an inexact variant of stochastic mirror descent (SMD), called inexact stochastic mirror descent (ISMD), to solve nonlinear two-stage...

    Vincent Guigues in Mathematical Programming
    Article 02 April 2020
  2. Stochastic Dynamic Cutting Plane for Multistage Stochastic Convex Programs

    We introduce Stochastic Dynamic Cutting Plane (StoDCuP), an extension of the Stochastic Dual Dynamic Programming (SDDP) algorithm to solve multistage...

    Vincent Guigues, Renato D. C. Monteiro in Journal of Optimization Theory and Applications
    Article 25 March 2021
  3. Outer Approximation for Mixed-Integer Nonlinear Robust Optimization

    Currently, few approaches are available for mixed-integer nonlinear robust optimization. Those that do exist typically either require restrictive...

    Martina Kuchlbauer, Frauke Liers, Michael Stingl in Journal of Optimization Theory and Applications
    Article Open access 27 October 2022
  4. An inexact primal-dual algorithm for semi-infinite programming

    This paper considers an inexact primal-dual algorithm for semi-infinite programming (SIP) for which it provides general error bounds. We create a new...

    Bo Wei, William B. Haskell, Sixiang Zhao in Mathematical Methods of Operations Research
    Article 01 January 2020
  5. Adjustable robust treatment-length optimization in radiation therapy

    Traditionally, optimization of radiation therapy (RT) treatment plans has been done before the initiation of RT course, using population-wide...

    S. C. M. ten Eikelder, A. Ajdari, ... D. den Hertog in Optimization and Engineering
    Article Open access 07 May 2022
  6. Benders decomposition with adaptive oracles for large scale optimization

    This paper proposes an algorithm to efficiently solve large optimization problems which exhibit a column bounded block-diagonal structure, where...

    Nicolò Mazzi, Andreas Grothey, ... Nagisa Sugishita in Mathematical Programming Computation
    Article Open access 30 November 2020
  7. Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations

    We study linear programming relaxations of nonconvex quadratic programs given by the reformulation–linearization technique (RLT), referred to as RLT...

    Yuzhou Qiu, E. Alper Yıldırım in Mathematical Programming
    Article Open access 06 March 2024
  8. Multi-Objective Fuzzy Probabilistic Programming Approach for Obtaining Optimum Crops Pattern with Water Replenishment

    This research paper is concerned with the solution procedure of a multi-objective fuzzy probabilistic problem (MOFPP), taking different crop patterns...

    S. Dutta, B. C. Sahoo, ... S. Nethra in International Journal of Applied and Computational Mathematics
    Article 19 June 2024
  9. An augmented Lagrangian method for optimization problems with structured geometric constraints

    This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with...

    **aoxi Jia, Christian Kanzow, ... Gerd Wachsmuth in Mathematical Programming
    Article Open access 27 September 2022
  10. Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse

    In this paper, we extend the adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse matrix and fixed cost...

    Murwan Siddig, Yongjia Song in Computational Optimization and Applications
    Article 03 November 2021
  11. A Discussion of Probability Functions and Constraints from a Variational Perspective

    Probability constraints are a popular modelling mechanism in applications. They help to model feasible decisions when the latter are taken prior to...

    Article 05 September 2020
  12. Variational methods for solving numerically magnetostatic systems

    In this paper, we study some techniques for solving numerically magnetostatic systems. We consider fairly general assumptions on the magnetic...

    Patrick Ciarlet Jr., Erell Jamelot in Advances in Computational Mathematics
    Article 04 January 2024
  13. A single cut proximal bundle method for stochastic convex composite optimization

    This paper considers optimization problems where the objective is the sum of a function given by an expectation and a closed convex function, and...

    Jiaming Liang, Vincent Guigues, Renato D. C. Monteiro in Mathematical Programming
    Article 11 December 2023
  14. A variational approach to Gibbs artifacts removal in MRI

    Gibbs ringing is a feature of MR images caused by the finite sampling of the acquisition space ( k -space). It manifests itself with ringing patterns...

    Germana Landi, Fabiana Zama in ANNALI DELL'UNIVERSITA' DI FERRARA
    Article Open access 09 August 2022
  15. Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm

    This paper develops an iterative algorithm to solve nonsmooth nonconvex optimization problems on complete Riemannian manifolds. The algorithm is...

    N. Hoseini Monjezi, S. Nobakhtian, M. R. Pouryayevali in Computational Optimization and Applications
    Article 02 April 2024
  16. Acceleration of Primal–Dual Methods by Preconditioning and Simple Subproblem Procedures

    Primal–dual hybrid gradient (PDHG) and alternating direction method of multipliers (ADMM) are popular first-order optimization methods. They are easy...

    Yanli Liu, Yunbei Xu, Wotao Yin in Journal of Scientific Computing
    Article 07 January 2021
  17. Cartoon-texture evolution for two-region image segmentation

    Two-region image segmentation is the process of dividing an image into two regions of interest, i.e., the foreground and the background. To this aim,...

    Laura Antonelli, Valentina De Simone, Marco Viola in Computational Optimization and Applications
    Article Open access 11 July 2022
  18. An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization

    Planning for multiple commodities simultaneously is a challenging task arising in divers applications, including robot motion or various forms of...

    Benno Hoch, Frauke Liers in Optimization and Engineering
    Article Open access 18 April 2022
Did you find what you were looking for? Share feedback.