Search results for "Comput. Optim. Appl."

Hits ?▲	Authors	Title	Venue	Year	Link
1	Paul-Emile Maingé, André Weng-Law	Accelerated forward-backward algorithms for structured monotone inclusions.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Claire Boyer, Antoine Godichon-Baggioni	Correction: On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Annalisa Greco, Francesco Cannizzaro, Riccardo Bruno, Alessandro Pluchino	A nested genetic algorithm strategy for an optimal seismic design of frames.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	E. Ruben van Beesten, Ward Romeijnders, Kees Jan Roodbergen	Convex approximations of two-stage risk-averse mixed-integer recourse models.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager, Robert Hildebrand	Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Marco Locatelli 0001	A new technique to derive tight convex underestimators (sometimes envelopes).	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Roger Behling, Yunier Bello-Cruz, Alfredo N. Iusem, Di Liu, Luiz-Rafael Santos	A successive centralized circumcentered-reflection method for the convex feasibility problem.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Can Li, Yannan Chen, Dong-Hui Li	Internet traffic tensor completion with tensor nuclear norm.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Shengchao Zhao, Yongchao Liu	Distributed stochastic compositional optimization problems over directed networks.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Mikhail A. Karapetyants	A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Elisabeth Diehl, Johannes Haubner, Michael Ulbrich, Stefan Ulbrich	Correction to: Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Christian Clason	Preface to special issue on "optimal control of nonlinear differential equations".	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Sudeep Kundu, Karl Kunisch	Policy iteration for Hamilton-Jacobi-Bellman equations with control constraints.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	E. Ruben van Beesten, Ward Romeijnders, Kees Jan Roodbergen	Convex approximations of two-stage risk-averse mixed-integer recourse models.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Shuotao Diao, Suvrajeet Sen	Distribution-free algorithms for predictive stochastic programming in the presence of streaming data.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	David Esteban Bernal Neira, Ignacio E. Grossmann	Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Shiru Li, Tao Zhang, Yong Xia 0002	A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Jianghua Yin, Jinbao Jian, Guodong Ma	A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Quoc Tran-Dinh	From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn 0001, Shinjae Yoo	Correction to: Stochastic projective splitting.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Daniel Wachsmuth	Optimal control problems with L0(Ømega ) constraints: maximum principle and proximal gradient method.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Flávia Chorobura, Ion Necoara	Coordinate descent methods beyond smoothness and separability.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Bennet Gebken	A note on the convergence of deterministic gradient sampling in nonsmooth optimization.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Javier Peña 0001	An easily computable upper bound on the Hoffman constant for homogeneous inequality systems.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Qingjie Hu, Liping Zhu, Yu Chen	Alternative extension of the Hager-Zhang conjugate gradient method for vector optimization.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Zichong Li, Pin-Yu Chen, Sijia Liu 0001, Songtao Lu, Yangyang Xu	Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Felipe Fidalgo, Emerson V. Castelani, Guilherme Philippi	A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Robert M. Gower, Dirk A. Lorenz, Maximilian Winkler	A Bregman-Kaczmarz method for nonlinear systems of equations.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Max Grieshammer, Lukas Pflug, Michael Stingl, Andrian Uihlein	The continuous stochastic gradient method: part II-application and numerics.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Max Grieshammer, Lukas Pflug, Michael Stingl, Andrian Uihlein	The continuous stochastic gradient method: part I-convergence theory.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Pourya Behmandpoor, Puya Latafat, Andreas Themelis, Marc Moonen, Panagiotis Patrinos	SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Fabian Hoppe, Ira Neitzel	A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Shummin Nakayama, Yasushi Narushima, Hiroshi Yabe	Inexact proximal DC Newton-type method for nonconvex composite functions.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Elisabeth Diehl, Johannes Haubner, Michael Ulbrich, Stefan Ulbrich	Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Bastian Pötzl, Anton Schiela, Patrick Jaap	Inexact proximal Newton methods in Hilbert spaces.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Ensio Suonperä, Tuomo Valkonen	Linearly convergent bilevel optimization with single-step inner methods.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Shiwei Wang 0004, Chao Ding	Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Max Grieshammer, Lukas Pflug, Michael Stingl, Andrian Uihlein	Correction to: The continuous stochastic gradient method: part II-application and numerics.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	A. Mohammadi, Ana Luísa Custódio	A trust-region approach for computing Pareto fronts in multiobjective optimization.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	R. Tyrrell Rockafellar	Generalizations of the proximal method of multipliers in convex optimization.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn 0001, Shinjae Yoo	Stochastic projective splitting.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Philip E. Gill, Minxin Zhang	A projected-search interior-point method for nonlinearly constrained optimization.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Stuart M. Harwood, Francisco Trespalacios, Dimitri J. Papageorgiou, Kevin C. Furman	Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Rui-Jin Zhang, Xin-Wei Liu, Yu-Hong Dai	IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Paul R. Arbic II, Vladislav Bukshtynov	Efficient gradient-based optimization for reconstructing binary images in applications to electrical impedance tomography.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager, Robert Hildebrand	Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Shahabeddin Najafi, Masoud Hajarian	Multiobjective BFGS method for optimization on Riemannian manifolds.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Yassine Nabou, Ion Necoara	Efficiency of higher-order algorithms for minimizing composite functions.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Matheus Bernardelli de Moraes, Guilherme Palermo Coelho	A benchmark generator for scenario-based discrete optimization.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
1	Hong T. M. Chu, Ling Liang, Kim-Chuan Toh, Lei Yang 0030	An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Ademir Alves Aguiar, Orizon Pereira Ferreira, Leandro da Fonseca Prudente	Inexact gradient projection method with relative error tolerance.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Nina Beranek, Martin Alexander Reinhold, Karsten Urban	A space-time variational method for optimal control problems: well-posedness, stability and numerical solution.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson	Results for the close-enough traveling salesman problem with a branch-and-bound algorithm.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Claire Boyer, Antoine Godichon-Baggioni	On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	R. Tyrrell Rockafellar	Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Tianxiang Liu, Ting Kei Pong, Akiko Takeda	Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Johannes Schmidt, Armin Fügenschuh	A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1		COAP 2022 Best Paper Prize.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Silvia Bonettini, Marco Prato, Simone Rebegoldi	A nested primal-dual FISTA-like scheme for composite convex optimization problems.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Hoai An Le Thi, Thi-Minh-Tam Nguyen, Tao Pham Dinh	On solving difference of convex functions programs with linear complementarity constraints.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Andrew Butler, Roy H. Kwon	Efficient differentiable quadratic programming layers: an ADMM approach.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Matteo Lapucci, Pierluigi Mansueto	A limited memory Quasi-Newton approach for multi-objective optimization.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Letícia Becher, Damián R. Fernández, Alberto Ramos 0001	A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Adeyemi D. Adeoye, Alberto Bemporad	SCORE: approximating curvature information under self-concordant regularization.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Robert Baier, Elza M. Farkhi	A Filippov approximation theorem for strengthened one-sided Lipschitz differential inclusions.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Jinyun Yuan	Preface to the 5th Brazil-China Symposium on Applied and Computational Mathematics.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Ciwen Chen, Guyan Ni, Bo Yang	Partially symmetric tensor structure preserving rank-R approximation via BFGS algorithm.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Shun Arahata, Takayuki Okuno, Akiko Takeda	Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Jie Zhang, Xinmin Yang, Gaoxi Li, Ke Zhang	A smoothing proximal gradient algorithm with extrapolation for the relaxation of ℓ0 regularization problem.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Gui-Hua Lin, Zhen-Ping Yang, Haian Yin, Jin Zhang 0002	A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Kaizhao Sun, X. Andy Sun	A two-level distributed algorithm for nonconvex constrained optimization.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Davide Previtali, Mirko Mazzoleni, Antonio Ferramosca, Fabio Previdi	GLISp-r: a preference-based optimization algorithm with convergence guarantees.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Zhijun Xu, Jing Zhou	A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Qing-Rui He, Chun-Rong Chen, Sheng-Jie Li	Spectral conjugate gradient methods for vector optimization problems.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Helmut Gfrerer, Michael Mandlmayr, Jirí V. Outrata, Jan Valdman	On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Jiawang Nie, Suhan Zhong	Loss functions for finite sets.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Masoumeh Hashemi, Roland Herzog, Thomas M. Surowiec	Optimal control of the stationary Kirchhoff equation.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	William W. Hager	Extension of switch point algorithm to boundary-value problems.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Orizon Pereira Ferreira, Geovani Nunes Grapiglia, Elianderson M. Santos, João Carlos de Oliveira Souza	A subgradient method with non-monotone line search.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Renaud Chicoisne	Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Dongdong Zhang, Shaohua Pan, Shujun Bi, Defeng Sun	Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Shaoze Li, Zhibin Deng, Cheng Lu 0007, Junhao Wu, Jinyu Dai, Qiao Wang	An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Ubaldo M. García-Palomares	Convergence of derivative-free nonmonotone Direct Search Methods for unconstrained and box-constrained mixed-integer optimization.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Yitian Qian, Shaohua Pan, Shujun Bi	A matrix nonconvex relaxation approach to unconstrained binary polynomial programs.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Kaiwen Ma, Luis Miguel Rios, Atharv Bhosekar, Nikolaos V. Sahinidis, Sreekanth Rajagopalan	Branch-and-Model: a derivative-free global optimization algorithm.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico	Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Valeria Ruggiero, Gerardo Toraldo	Special issue for SIMAI 2020-2021: large-scale optimization and applications.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Natasa Krejic, Greta Malaspina, Lense Swaenen	A split Levenberg-Marquardt method for large-scale sparse problems.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Christian Kanzow, Matteo Lapucci	Inexact penalty decomposition methods for optimization problems with geometric constraints.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Hiroki Tanabe, Ellen H. Fukuda, Nobuo Yamashita	An accelerated proximal gradient method for multiobjective optimization.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Serena Crisci, Federica Porta, Valeria Ruggiero, Luca Zanni	Hybrid limited memory gradient projection methods for box-constrained optimization problems.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Lei Wang, Xin Liu 0001, Yin Zhang	A communication-efficient and privacy-aware distributed algorithm for sparse PCA.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Johannes von Lindheim	Simple approximative algorithms for free-support Wasserstein barycenters.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Cecilia Orellana Castro, Manolo Rodriguez Heredia, Aurelio R. L. Oliveira	Recycling basic columns of the splitting preconditioner in interior point methods.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Annamaria Barbagallo, Serena Guarino Lo Bianco	A random time-dependent noncooperative equilibrium problem.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Wang Chen, Xinmin Yang, Yong Zhao	Conditional gradient method for vector optimization.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Naoki Marumo, Takayuki Okuno, Akiko Takeda	Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Shaoyan Guo, Hou-Duo Qi, Liwei Zhang	Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Wen Huang 0001, Ke Wei	An inexact Riemannian proximal gradient method.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
1	Saravanan Venkatachalam, Lewis Ntaimo	Integer set reduction for stochastic mixed-integer programming.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF

Publications at "Comput. Optim. Appl."( http://dblp.L3S.de/Venues/Comput._Optim._Appl. )