scientific article

zbMath1015.90077MaRDI QIDQ3151174

Dimitri P. Bertsekas

Publication date: 22 October 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

unconstrained optimizationNewton's methodLagrange multiplierdualityconvex programmingnonlinear programminggradient methodssemi-definite programmingline search methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Semi-infinite programming (90C34) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

On the application of the spectral projected gradient method in image segmentation, Optimal quantization of the support of a continuous multivariate distribution based on mutual information, An incremental decomposition method for unconstrained optimization, Differential systems for constrained optimization via a nonlinear augmented Lagrangian, An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions, On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems, Bounding duality gap for separable problems with linear constraints, Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints, On structural decompositions of finite frames, Exploring trust region method for the solution of logit-based stochastic user equilibrium problem, On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature, On some steplength approaches for proximal algorithms, A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process, A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks, On the optimality of Napoleon triangles, The use of squared slack variables in nonlinear second-order cone programming, Packing ellipsoids by nonlinear optimization, A dual method for minimizing a nonsmooth objective over one smooth inequality constraint, Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem, Using drinking data and pharmacokinetic modeling to calibrate transport model and blind deconvolution based data analysis software for transdermal alcohol biosensors, Controller architectures: tradeoffs between performance and structure, A weighted mirror descent algorithm for nonsmooth convex optimization problem, Monotonicity and market equilibrium, Sparse topical analysis of dyadic data using matrix tri-factorization, A framework for and empirical study of algorithms for traffic assignment, Continuous adjoint methods for turbulent flows, applied to shape and topology optimization: industrial applications, Optimal iterative QP and QPQC algorithms, Constraint qualifications and optimality conditions for optimization problems with cardinality constraints, Efficient accuracy evaluation for multi-modal sensed data, Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications, Subgradient method for nonconvex nonsmooth optimization, Complexity of solution structures in nonlinear pricing, Tacit collusion games in pool-based electricity markets under transmission constraints, A model-free no-arbitrage price bound for variance options, Fast alternating linearization methods for minimizing the sum of two convex functions, Forward-backward penalty scheme for constrained convex minimization without inf-compactness, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Constrained multifidelity optimization using model calibration, Optimization over the efficient set of multi-objective convex optimal control problems, Numerical monitoring of natural gas distribution discrepancy using CFD simulator, Low-rank tensor completion by Riemannian optimization, Block coordinate descent algorithms for large-scale sparse multiclass classification, Simultaneous clustering and classification over cluster structure representation, Sequence classification via large margin hidden Markov models, On camera calibration with linear programming and loop constraint linearization, An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem, On penalty and gap function methods for bilevel equilibrium problems, SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels, Dual coordinate descent methods for logistic regression and maximum entropy models, An improved Newton projection method for nonnegative deblurring of Poisson-corrupted images with Tikhonov regularization, Coupling the gradient method with a general exterior penalization scheme for convex minimization, Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints, Phase transitions for greedy sparse approximation algorithms, Non-monotone projection gradient method for non-negative matrix factorization, 3D human posture segmentation by spectral clustering with surface normal constraint, An optimal method for stochastic composite optimization, An implementable proximal point algorithmic framework for nuclear norm minimization, User density sensitive P2P streaming in wireless mesh networks, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, Recursive sum-product algorithm for generalized outer-planar graphs, Efficient nonnegative matrix factorization via projected Newton method, A reservoir-driven non-stationary hidden Markov model, The solution path of the generalized lasso, Smoothing proximal gradient method for general structured sparse regression, Quadratic approximation on SCAD penalized estimation, Input design for guaranteed fault diagnosis using zonotopes, Training Lp norm multiple kernel learning in the primal, A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints, The 2-coordinate descent method for solving double-sided simplex constrained minimization problems, The bound-constrained conjugate gradient method for non-negative matrices, A first order method for finding minimal norm-like solutions of convex optimization problems, The divergence of the BFGS and Gauss Newton methods, Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function, A symmetric rank-one quasi-Newton method for nonnegative matrix factorization, Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule, A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares, On a smooth dual gap function for a class of quasi-variational inequalities, A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization, mReno: a practical multipath congestion control for communication networks, On optimal low rank Tucker approximation for tensors: the case for an adjustable core size, A box-constrained differentiable penalty method for nonlinear complementarity problems, A modified active set algorithm for transportation discrete network design bi-level problem, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, Incremental gradient method for Karcher mean on symmetric cones, Computing the generalized eigenvalues of weakly symmetric tensors, A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization, On the linear convergence of the alternating direction method of multipliers, An inexact restoration derivative-free filter method for nonlinear programming, A bilateral-truncated-loss based robust support vector machine for classification problems, Differentiable McCormick relaxations, A stochastic minimum principle and an adaptive pathwise algorithm for stochastic optimal control, Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems, Iteration complexity analysis of block coordinate descent methods, An iteratively approximated gradient projection algorithm for sparse signal reconstruction, A first-order interior-point method for linearly constrained smooth optimization, Optimal transition maneuvers for a class of V/STOL aircraft, Convergence results of an augmented Lagrangian method using the exponential penalty function, Primal recovery from consensus-based dual decomposition for distributed convex optimization, A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems, Powered embarrassing parallel MCMC sampling in Bayesian inference, a weighted average intuition, Adjoint formulation and constraint handling for gradient-based optimization of compositional reservoir flow, Cost-sensitive estimation of ARMA models for financial asset return data, A closer look at consistent operator splitting and its extensions for topology optimization, On the information-adaptive variants of the ADMM: an iteration complexity perspective, Maximum margin semi-supervised learning with irrelevant data, Smoothly approximated support vector domain description, Exact worst-case convergence rates of the proximal gradient method for composite convex minimization, A scaled gradient method for digital tomographic image reconstruction, DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling, A globally convergent algorithm for nonconvex optimization based on block coordinate update, SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances, Generalized Kalman smoothing: modeling and algorithms, A feasible direction method for image restoration, A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints, On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions, A numerical approach to optimal coherent quantum LQG controller design using gradient descent, A doubly sparse approach for group variable selection, Nonlinear multi-output regression on unknown input manifold, \(\ell^2\)-stability: the cases of infinite dimensional discrete autonomous systems and 2-D autonomous systems, Dual decomposition for multi-agent distributed optimization with coupling constraints, Decomposition strategy for the stochastic pooling problem, A two-level solution approach for solving the generalized minimum spanning tree problem, On a smoothed penalty-based algorithm for global optimization, On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory, A novel kernel correlation model with the correspondence estimation, Data filtering for cluster analysis by \(\ell _0\)-norm regularization, A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic, Optimal subgradient algorithms for large-scale convex optimization in simple domains, Variance-constrained actor-critic algorithms for discounted and average reward MDPs, Inexact proximal stochastic gradient method for convex composite optimization, Shrinking gradient descent algorithms for total variation regularized image denoising, Fast derivatives of likelihood functionals for ODE based models using adjoint-state method, Optimal stopping with a probabilistic constraint, Energy-consistent simulation of frictional contact in rigid multibody systems using implicit surfaces and penalty method, NPtool: a MATLAB software for nonnegative image restoration with Newton projection methods, Fast projections onto mixed-norm balls with applications, A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems, A cyclic projected gradient method, Linear convergence analysis of the use of gradient projection methods on total variation problems, Numerical computation of convex risk measures, Regularizers for structured sparsity, Hierarchical sparse modeling: a choice of two group Lasso formulations, Altruistic agents in uncertain dynamic games, Self-concordant analysis for logistic regression, Sparse regression with exact clustering, Solving the short-term scheduling problem of hydrothermal systems via Lagrangian relaxation and augmented Lagrangian, Portfolio selection under model uncertainty: a penalized moment-based optimization approach, Separable spherical constraints and the decrease of a quadratic function in the gradient projection step, Distributed constrained optimization via continuous-time mirror design, A co-classification approach to learning from multilingual corpora, Learning to rank on graphs, Discovery of new complementarity functions for NCP and SOCCP, On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming, The effect of deterministic noise in subgradient methods, Weakly supervised nonnegative matrix factorization for user-driven clustering, Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization, Global optimal consensus for discrete-time multi-agent systems with bounded controls, Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights, Optimal control of switching topology networks, Matrix factorization for evolution data, Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure, Stochastic block-coordinate gradient projection algorithms for submodular maximization, Sensitivity-based nested partitions for solving finite-horizon Markov decision processes, Single stage prediction with embedded topic modeling of online reviews for mobile app management, Large-scale unit commitment under uncertainty: an updated literature survey, Shape constraints in economics and operations research, A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem, Proximal alternating penalty algorithms for nonsmooth constrained convex optimization, Newton's method with feasible inexact projections for solving constrained generalized equations, An Arrow-Hurwicz-Uzawa type flow as least squares solver for network linear equations, Initialization-free privacy-guaranteed distributed algorithm for economic dispatch problem, Distributed optimization over directed graphs with row stochasticity and constraint regularity, Recovering Markov models from closed-loop data, A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees, Sub-sampled Newton methods, Deep neural networks with a set of node-wise varying activation functions, Distributed optimization and control with ALADIN, Control of \(M|M|1|N\) queue parameters under constraints, Preconditioned accelerated gradient descent methods for locally Lipschitz smooth objectives with applications to the solution of nonlinear PDEs, Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming, A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties, A mixture of nuclear norm and matrix factorization for tensor completion, Estimation of the parameters of the extended growth curve model under multivariate skew normal distribution, Numerical recovery of gas flows in pipeline systems, Cyclic seesaw process for optimization and identification, A geometric analysis of phase retrieval, Robust sample average approximation, Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available, A primal-simplex based Tardos' algorithm, A simple algorithm for a class of nonsmooth convex-concave saddle-point problems, Log-robust portfolio management with parameter ambiguity, A block coordinate variable metric linesearch based proximal gradient method, Flexible low-rank statistical modeling with missing data and side information, Efficient dictionary learning with sparseness-enforcing projections, ROML: a robust feature correspondence approach for matching objects in a set of images, Two algorithms for fitting constrained marginal models, Polyhedral approximation in mixed-integer convex optimization, Mirror descent and nonlinear projected subgradient methods for convex optimization., Optimal control of cylinder wakes via suction and blowing, Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder), Off-diagonal symmetric nonnegative matrix factorization, A linearly convergent algorithm for sparse signal reconstruction, An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems, Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems, A successive linear approximation algorithm for the global minimization of a concave quadratic program, Continuous dynamics related to monotone inclusions and non-smooth optimization problems, Linearized alternating direction method of multipliers for sparse group and fused Lasso models, A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing, Distributionally robust single machine scheduling with the total tardiness criterion, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, A new learning algorithm for optimal stopping, A convergent decomposition method for box-constrained optimization problems, Service system design for managing interruption risks: a backup-service risk-mitigation strategy, Aerodynamic shape optimization using first and second order adjoint and direct approaches, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, Constraint handling for gradient-based optimization of compositional reservoir flow, Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices, Blind deconvolution for distributed parameter systems with unbounded input and output and determining blood alcohol concentration from transdermal biosensor data, Bayesian uncertainty quantification of turbulence models based on high-order adjoint, The method of Lagrange multipliers for the class of subsmooth mappings, A simplified view of first order methods for optimization, An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems, A convex optimization approach for solving large scale linear systems, A theoretical analysis of the cross-nested logit model, A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization, Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem, Numerical methods for parameter estimation in Poisson data inversion, Feature-aware regularization for sparse online learning, Optimal reactive power allocation in large-scale grid-connected photovoltaic systems, A new steplength selection for scaled gradient methods with application to image deblurring, Copula-based randomized mechanisms for truthful scheduling on two unrelated machines, Differential properties of Euclidean projection onto power cone, Critical oscillation constant for half-linear differential equations with periodic coefficients, A note on the complexity of \(L _{p }\) minimization, Incremental proximal methods for large scale convex optimization, Path loss prediction in urban environment using learning machines and dimensionality reduction techniques, A nonlinear duopoly with efficient production-capacity levels, A dynamic Cournot-Nash game: a representation of a finitely repeated feedback game, Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints, Augmented Lagrangian functions for constrained optimization problems, Newton's method and secant methods: a longstanding relationship from vectors to matrices, Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression, A projected Newton-CG method for nonnegative astronomical image deblurring, A branch-and-cut algorithm for a class of sum-of-ratios problems, Developing a new approach for (biological) optimal control problems: application to optimization of laccase production with a comparison between response surface methodology and novel geometric procedure, Simplex-inspired algorithms for solving a class of convex programming problems, Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs, On the surrogate gradient algorithm for Lagrangian relaxation, Tracking-protection-recovery switching control for aero-engines, Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points, Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications, Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data, An inertial proximal-gradient penalization scheme for constrained convex optimization problems, Theoretically supported scalable BETI method for variational inequalities, Some convex programs without a duality gap, A coordinate gradient descent method for nonsmooth separable minimization, A decomposition algorithm for unconstrained optimization problems with partial derivative information, On extracting information implied in options, A sequential parametric convex approximation method with applications to nonconvex truss topology design problems, Solving a large scale semi-definite logit model, Extended duality for nonlinear programming, Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements, An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications, A relaxed constant positive linear dependence constraint qualification and applications, Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications, Filter-based DIRECT method for constrained global optimization, A generalized projection-based scheme for solving convex constrained optimization problems, On nonmonotone Chambolle gradient projection algorithms for total variation image restoration, Approximate Karush-Kuhn-Tucker condition in multiobjective optimization, A block coordinate variable metric forward-backward algorithm, A smoothing algorithm for finite min-max-min problems, Discrimination of two planar structures in directional data, Structured machine learning: the next ten years, Joint variable and rank selection for parsimonious estimation of high-dimensional matrices, Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework, Generalized row-action methods for tomographic imaging, The cell matrix closest to a given Euclidean distance matrix, A geometric analysis of Renegar's condition number, and its interplay with conic curvature, Data-driven estimation in equilibrium using inverse optimization, Global solution of bilevel programs with a nonconvex inner program, Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization, Optimum experimental designs for dynamic systems in the presence of correlated errors, A tutorial on geometric programming, A global optimization approach for three layers of computational grid stack, Low order-value optimization and applications, A scalable FETI-DP algorithm for a semi-coercive variational inequality, Subgradient methods for saddle-point problems, On solvability of convex noncoercive quadratic programming problems, Cost minimization of a multiple section power cable supplying several remote telecom equipment, Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs, Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach, Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control, Support vector machine classification with indefinite kernels, Sparse polynomial chaos expansions using variational relevance vector machines, An active-set algorithmic framework for non-convex optimization problems over the simplex, On the resolution of misspecified convex optimization and monotone variational inequality problems, Convergence rates of subgradient methods for quasi-convex optimization problems, Newton's method for nonparallel plane proximal classifier with unity norm hyperplanes, Adaptive reduced-rank LCMV beamforming algorithms based on joint iterative optimization of filters: design and analysis, Dissecting the duality gap: the supporting hyperplane interpretation revisited, New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming, On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees, Efficient convex optimization-based texture mapping for large-scale 3D scene reconstruction, Robust food-energy-water-environmental security management: Stochastic quasigradient procedure for linkage of distributed optimization models under asymmetric information and uncertainty, An accelerated minimal gradient method with momentum for strictly convex quadratic optimization, A primal-dual algorithm for risk minimization, An accelerated coordinate gradient descent algorithm for non-separable composite optimization, A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints, Multi-stream \((Q,r)\) model and optimization for data prefetching, Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms, An optimization model and method for supply chain equilibrium management problem, A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint, A frequency-domain analysis of inexact gradient methods, Estimation and computations for Gaussian mixtures with uniform noise under separation constraints, Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering, Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming, Certifying the global optimality of quartic minimization over the sphere, A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise, On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices, Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC, Necessary optimality conditions for interval optimization problems with functional and abstract constraints, Benefits of noise in M-estimators: optimal noise level and probability density, Column generation for the equilibrium route-flow traffic assignment problem, Classes of linear programs solvable by coordinate-wise minimization, Safety control of a class of fully actuated systems subject to uncertain actuation dynamics, The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis, Sparsity preserving optimal control of discretized PDE systems, Variational community partition with novel network structure centrality prior, Geometric optimization using nonlinear rotation-invariant coordinates, An adaptive model with joint chance constraints for a hybrid wind-conventional generator system, Medical facility network design: user-choice and system-optimal models, Aggregate subgradient method for nonsmooth DC optimization, Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization, The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints, Embedding equality constraints of optimization problems into a quantum annealer, Regularized LTI system identification in the presence of outliers: a variational EM approach, Perfect competition vs. strategic behaviour models to derive electricity prices and the influence of renewables on market power, Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, Solving nearly-separable quadratic optimization problems as nonsmooth equations, Online optimization for max-norm regularization, A hybrid second-order method for homogenous polynomial optimization over unit sphere, Optimal capital allocation based on the tail mean-variance model, MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems, Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema, Simple algorithms for optimization on Riemannian manifolds with constraints, Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy, Outer approximation for integer nonlinear programs via decision diagrams, Chebyshev center of the intersection of balls: complexity, relaxation and approximation, Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems, Optimal correction of the absolute value equations, Calibrated model-based evidential clustering using bootstrapping, Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion, Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization, Accelerated diagonal steepest descent method for unconstrained multiobjective optimization, Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations, Pseudospectral optimal train control, Transmission network investment using incentive regulation: a disjunctive programming approach, An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information, Tax-aware portfolio construction via convex optimization, On a minimum enclosing ball of a collection of linear subspaces, A study on distributed optimization over large-scale networked systems, Sparse randomized shortest paths routing with Tsallis divergence regularization, Duality in nonconvex vector optimization, Harnack inequality and an asymptotic mean-value property for the Finsler infinity-Laplacian, On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems, Partially distributed outer approximation, Analysis of optimization algorithms via sum-of-squares, Imputation of clinical covariates in time series, Coupling matrix manifolds assisted optimization for optimal transport problems, On the oracle complexity of smooth strongly convex minimization, ORCA: outlier detection and robust clustering for attributed graphs, T-product factorization method for internet traffic data completion with spatio-temporal regularization, A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization, Falsification of hybrid systems with symbolic reachability analysis and trajectory splicing, A distributed continuous-time modified Newton-Raphson algorithm, Steering the aggregative behavior of noncooperative agents: a nudge framework, A feasibility-ensured Lagrangian heuristic for general decomposable problems, On the inexact scaled gradient projection method, Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming, The regularized feasible directions method for nonconvex optimization, A variational approach to Gibbs artifacts removal in MRI, On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches, Multimodal correlations-based data clustering, An outer-approximation guided optimization approach for constrained neural network inverse problems, Spline estimation of functional principal components via manifold conjugate gradient algorithm, Decomposition of completely symmetric states, Space partitioning and regression maxima seeking via a mean-shift-inspired algorithm, Nondegeneracy of eigenvectors and singular vector tuples of tensors, Multiobjective strict dissipativity via a weighted sum approach, A nested primal-dual FISTA-like scheme for composite convex optimization problems, Hybrid limited memory gradient projection methods for box-constrained optimization problems, On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces, Multi-phase algorithm design for accurate and efficient model fitting, R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization, Nonlinear chance-constrained problems with applications to hydro scheduling, Computational modeling of size-dependent superelasticity of shape memory alloys, Laplacian smoothing gradient descent, Solving a fractional programming problem in a commercial bank, A theoretical justification of the set covering greedy heuristic of Caprara et al., Dynamic spatial equilibrium models: an application to the natural gas spot markets, Distributed algorithms for convex problems with linear coupling constraints, Locally Lipschitz vector optimization problems: second-order constraint qualifications, regularity condition and KKT necessary optimality conditions, A gradient-type algorithm for constrained optimization with application to microstructure optimization, Post-boosting of classification boundary for imbalanced data using geometric mean, Accelerating incremental gradient optimization with curvature information, On the use of third-order models with fourth-order regularization for unconstrained optimization, Tightening big Ms in integer programming formulations for support vector machines with ramp loss, Image denoising using \(L^p\)-norm of mean curvature of image surface, Randomness and permutations in coordinate descent methods, Inexact Newton method with feasible inexact projections for solving constrained smooth and nonsmooth equations, Utility maximization for bandwidth allocation in peer-to-peer file-sharing networks, A novel projected gradient-like method for optimization problems with simple constraints, Towards an efficient augmented Lagrangian method for convex quadratic programming, Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification, A geometric Gauss-Newton method for least squares inverse eigenvalue problems, 3D fluid flow estimation with integrated particle reconstruction, Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings, Finding second-order stationary points in constrained minimization: a feasible direction approach, Joint multi-view representation and image annotation via optimal predictive subspace learning, Monte Carlo co-ordinate ascent variational inference, Bridging the gap between constant step size stochastic gradient descent and Markov chains, Computing nearby non-trivial Smith forms, A multi-objective memetic algorithm for low rank and sparse matrix decomposition, Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints, Classification with costly features as a sequential decision-making problem, On the complexity of testing attainment of the optimal value in nonlinear optimization, A new view of some fundamental results in optimization, The trajectory intersection: an approach for nonlinear down-sampling, Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming, Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version, Power markets with information-aware self-scheduling electric vehicles, A unified approach for deriving optimal finite differences, Adaptive activation functions accelerate convergence in deep and physics-informed neural networks, On constrained optimization with nonconvex regularization, Particle swarm optimization for computing Nash and Stackelberg equilibria in energy markets, Analysis of the alternating direction method of multipliers for nonconvex problems, Why random reshuffling beats stochastic gradient descent, A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model, Words, permutations, and the nonsolvable length of a finite group, Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments, An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices, Large-scale dynamic system optimization using dual decomposition method with approximate dynamic programming, Using gradient directions to get global convergence of Newton-type methods, Differential equation method based on approximate augmented Lagrangian for nonlinear programming, Estrogen receptor expression on breast cancer patients' survival under shape-restricted Cox regression model, Optimality conditions for maximizing a function over a polyhedron, Efficient formulations for pricing under attraction demand models, Nonnegative rank factorization -- a heuristic approach via rank reduction, Incrementally updated gradient methods for constrained and regularized optimization, An inexact and nonmonotone proximal method for smooth unconstrained minimization, Conditional gradient Tikhonov method for a convex optimization problem in image restoration, The Laplacian of a uniform hypergraph, Finding maxmin allocations in cooperative and competitive fair division, Sparse distance metric learning, A generalized Newton algorithm for quantile regression models, Weiszfeld's method: old and new results, Simultaneous perturbation Newton algorithms for simulation optimization, Optimal partitioning of testing time: theoretical properties and practical implications, A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks, The weight-decay technique in learning from data: an optimization point of view, A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface, Algorithms for automatic ranking of participants and tasks in an anonymized contest, Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, Blockwise projection matrix versus blockwise data on undersampled problems: analysis, comparison and applications, Adaptive conditional gradient method, Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM, Constructive generalization of classical sufficient second-order optimality conditions, A modified truncated Newton algorithm for the logit-based stochastic user equilibrium problem, ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration, Bounds on strongly orthogonal ranks of tensors, Efficient generation of performance bounds for a class of traffic scheduling problems, A kernel-based trend pattern tracking system for portfolio optimization, A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming, Multiple-source ellipsoidal localization using acoustic energy measurements, Production planning and scheduling in mining scenarios under IPCC mining systems, Feasibility and cost minimisation for a lithium extraction problem, Optimal revenue management in two class pre-emptive delay dependent Markovian queues, Ordered line integral methods for solving the eikonal equation, Robust Schatten-\(p\) norm based approach for tensor completion, Spectral three-term constrained conjugate gradient algorithm for function minimizations, Using a factored dual in augmented Lagrangian methods for semidefinite programming, A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization, On polyhedral and second-order cone decompositions of semidefinite optimization problems, Faster subgradient methods for functions with Hölderian growth, Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision, A unified convergence framework for nonmonotone inexact decomposition methods, Profit-based churn prediction based on minimax probability machines, New constraint qualifications with second-order properties in nonlinear optimization, Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers, Sequential parametric convex approximation algorithm for bilinear matrix inequality problem, Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications, 2-factor Newton method for solving constrained optimization problems with a degenerate Kuhn-Tucker system, A class of alternating linearization algorithms for nonsmooth convex optimization, Non-concave penalization in linear mixed-effect models and regularized selection of fixed effects, Convergence rates of forward-Douglas-Rachford splitting method, Natural gas production network infrastructure development under uncertainty, Forward-backward quasi-Newton methods for nonsmooth optimization problems, Linearly convergent away-step conditional gradient for non-strongly convex functions, On modeling the advertising-operations interface under asymmetric competition, Continuous quadratic programming formulations of optimization problems on graphs, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, Building an iterative heuristic solver for a quantum annealer, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Force sensing using 3D displacement measurements in linear elastic bodies, Global optimization issues in deep network regression: an overview, Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming, Non-negatively constrained image deblurring with an inexact interior point method, Certification aspects of the fast gradient method for solving the dual of parametric convex programs, A survey on dual decomposition methods, Application of the sequential parametric convex approximation method to the design of robust trusses, Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm, Nonlinear reduced-order observer-based predictive control for diving of an autonomous underwater vehicle, Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method, A nonlinear programming model with implicit variables for packing ellipsoids, An approximate bundle method for solving nonsmooth equilibrium problems, Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation, When does OMP achieve exact recovery with continuous dictionaries?, Graph Fourier transform based on \(\ell_1\) norm variation minimization, The modified accelerated Bregman method for regularized basis pursuit problem, How to solve a design centering problem, An alternating maximization method for approximating the hump of the matrix exponential, Model uncertainty, recalibration, and the emergence of delta-vega hedging, Optimality conditions for nonlinear semidefinite programming via squared slack variables, Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, Stochastic dual dynamic integer programming, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, Alternating direction method of multipliers for nonconvex fused regression problems, Proximal gradient methods for multiobjective optimization and their applications, A strong Lagrangian relaxation for general discrete-choice network revenue management, PAL-Hom method for QP and an application to LP, Spectral analysis of the preconditioned system for the \(3 \times 3\) block saddle point problem, Stepsize domain confirmation and optimum of zead formula for future optimization, Augmented Lagrangian method with alternating constraints for nonlinear optimization problems, An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso, M-eigenvalue inclusion intervals for a fourth-order partially symmetric tensor, A sequential quadratic Hamiltonian method for solving parabolic optimal control problems with discontinuous cost functionals, A second-order convergence augmented Lagrangian method using non-quadratic penalty functions, Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach, Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization, Distributed nonconvex constrained optimization over time-varying digraphs, Two-stage time-optimal formation reconfiguration strategy, MM algorithms for geometric and signomial programming, On the mixed even-spin Sherrington-Kirkpatrick model with ferromagnetic interaction, A boundary integral formulation for particle trajectories in Stokes waves, Calibrating nonconvex penalized regression in ultra-high dimension, Outlier detection and robust covariance estimation using mathematical programming, Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks, A scenario decomposition algorithm for 0-1 stochastic programs, Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, A spatially continuous max-flow and min-cut framework for binary labeling problems, Constraint-softening in model predictive control with off-line-optimized admissible sets for systems with additive and multiplicative disturbances, D-optimal design of a monitoring network for parameter estimation of distributed systems, An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum, Self-concordant functions for optimization on smooth manifolds, Optimal control of two-stage discrete event systems with real-time constraints, Pathwise coordinate optimization, Breast tumor susceptibility to chemotherapy via support vector machines, An improved gradient projection-based decomposition technique for support vector machines, Nonmonotone projected gradient methods based on barrier and Euclidean distances, Box-constrained minimization reformulations of complementarity problems in second-order cones, A geometric framework for nonconvex optimization duality using augmented Lagrangian functions, An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization, Basis function adaptation in temporal difference reinforcement learning, Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces, Robust game theory, Fast linear iterations for distributed averaging, Non-negative matrix factorization under equality constraints -- a study of industrial source identification, Blended coarse gradient descent for full quantization of deep neural networks, Conical regularization for multi-objective optimization problems, Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging, Mixture augmented Lagrange multiplier method for tensor recovery and its applications, On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity, A nonlinear state marginal price vector model for the task of business valuation. A case study: the dimensioning of IT-service companies under nonlinear synergy effects, Quantile regression approach to conditional mode estimation, Distributed coordination for nonsmooth convex optimization via saddle-point dynamics, Derivative free methodologies for circuit worst case analysis, Optimization problems involving group sparsity terms, Rapid, robust, and reliable blind deconvolution via nonconvex optimization, The use of bigrams to enhance text categorization, An unconstrained smooth minimization reformulation of the second-order cone complementarity problem, Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems, On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators, Derivative-free methods for mixed-integer constrained optimization problems, A family of multi-path congestion control algorithms with global stability and delay robustness, Recursive algorithms for parameter estimation with adaptive quantizer, Eigenvalue conditions for induced subgraphs, A flexible inexact-restoration method for constrained optimization, A globally convergent incremental Newton method, An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method, Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates, Large-scale unit commitment under uncertainty, Algorithmically generated rodent hepatic vascular trees in arbitrary detail, SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering, A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring, An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand, Strict convex regularizations, proximal points and augmented lagrangians, A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems, The Cyclic Block Conditional Gradient Method for Convex Optimization Problems, Dual Techniques for Scheduling on a Machine with Varying Speed, The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems, Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors, MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization, Convergence, stability and robustness analysis of the OFEX controller for high-speed networks, Descent Methods for Nonnegative Matrix Factorization, Distributed Block Coordinate Descent for Minimizing Partially Separable Functions, An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints, Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem, A Cone-Continuity Constraint Qualification and Algorithmic Consequences, Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems, An Efficient Algorithm for Video Superresolution Based on a Sequential Model, Optimizing Image Quality, Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization, On the Stabilizing Properties of Energy-Momentum Integrators and Coordinate Projections for Constrained Mechanical Systems, A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control, Sparsest representations and approximations of an underdetermined linear system, Globally Solving the Trust Region Subproblem Using Simple First-Order Methods, New convergence results for the inexact variable metric forward-backward method, Model structure selection for switched NARX system identification: a randomized approach, Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems, Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs, On consistency of the monotone NPMLE of survival function under the mixed case interval-censored model with left truncation, Design of biased random walks on a graph with application to collaborative recommendation, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization, On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier, Dynamic marketing policies with rating-sensitive consumers: a mean-field games approach, Existence and Approximation for Variational Problems Under Uniform Constraints on the Gradient by Power Penalty, On convexification for a class of global optimization problems, Optimal non-asymptotic analysis of the Ruppert-Polyak averaging stochastic algorithm, Dynamic optimization of state-dependent switched systems with free switching sequences, Ubiquitous algorithms in convex optimization generate self-contracted sequences, Novel Algorithm for Non-Negative Matrix Factorization, An exact penalty approach for optimization with nonnegative orthogonality constraints, Convergence rates analysis of a multiobjective proximal gradient method, Stochastic first-order methods for convex and nonconvex functional constrained optimization, On High-order Model Regularization for Constrained Optimization, Pattern search in the presence of degenerate linear constraints, Optimal capital allocation for individual risk model using a mean-variance principle, Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications, Proximal Mapping for Symmetric Penalty and Sparsity, An abstract convergence framework with application to inertial inexact forward-backward methods, Inexact gradient projection method with relative error tolerance, A subgradient method with non-monotone line search, On global convergence of alternating least squares for tensor approximation, A two-level distributed algorithm for nonconvex constrained optimization, A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem, A complementarity model for a supply chain network equilibrium problem with electronic commerce, Noncausal Optimal Tracking of Linear Switched Systems, Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications, Optimal Planning of Distributed Generation via Nonlinear Optimization and Genetic Algorithms, A general solution method for moral hazard problems, Oracle Inequalities for Local and Global Empirical Risk Minimizers, Value Function Calculus and Applications, Recent Advances in Stochastic Riemannian Optimization, A three-field augmented Lagrangian formulation of unilateral contact problems with cohesive forces, Sequential Convex Programming for the Efficient Verification of Parametric MDPs, 3/4-Discrete Optimal Transport, Nonparametric Imputation by Data Depth, Global Optimization in Practice:State of the Art and Perspectives, Risk-Constrained Reinforcement Learning with Percentile Risk Criteria, Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, A Computationally Efficient Method for Nonparametric Modeling of Neural Spiking Activity with Point Processes, Proportionally fair flow control mechanism for best effort traffic in network-on-chip architectures, Unnamed Item, Unnamed Item, Unnamed Item, Robust Control of Smart Material-based Actuators, Convergence of the linearized Bregman iteration for ℓ₁-norm minimization, Configuring A Sensor Network for Fault Detection in Distributed Parameter Systems, An analytical fuzzy-based approach to -gain optimal control of input-affine nonlinear systems using Newton-type algorithm, Optimal Kullback–Leibler approximation of Markov chains via nuclear norm regularisation, Deniable Functional Encryption, Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization, Block Coordinate Descent Methods for Semidefinite Programming, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, Bounded Matrix Low Rank Approximation, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications, Low-Rank Spectral Optimization via Gauge Duality, Modular proximal optimization for multidimensional total-variation regularization, Derivative-free nonlinear optimization filter simplex, A projected gradient method for optimization over density matrices, A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming, Projection onto a Polyhedron that Exploits Sparsity, An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems, Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, Variance Regularization in Sequential Bayesian Optimization, Resource Allocation in Communication Networks with Large Number of Users: The Dual Stochastic Gradient Method, A symmetric rank-one quasi-Newton line-search method using negative curvature directions, Concave programming for finding sparse solutions to problems with convex constraints, Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods, Graphs and Algorithms in Communication Networks on Seven League Boots, Introduction to Support Vector Machines and Their Applications in Bankruptcy Prognosis, The convex and monotone functions associated with second-order cone, A non-monotonic method for large-scale non-negative least squares, On high-order model regularization for multiobjective optimization, Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields, Sparse Approximations with Interior Point Methods, Subgradient method with feasible inexact projections for constrained convex optimization problems, Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity, On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent, A Comprehensive Approach for Camera/LIDAR Frame Alignment, A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, An Optimal Control Framework for Online Job Scheduling with General Cost Functions, Route-reduction-based dynamic programming for large-scale satellite range scheduling problem, An Algorithm for Maximizing a Convex Function Based on Its Minimum, A Pseudo-Likelihood Approach to Linear Regression With Partially Shuffled Data, Unnamed Item, Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, A new nonlocal low-rank regularization method with applications to magnetic resonance image denoising, DYNAMIC OPTIMAL CONTROL PROBLEMS IN HAMILTONIAN AND LAGRANGIAN SYSTEMS, Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian, Unnamed Item, Unnamed Item, Beetle swarm optimization algorithm: Theory and application, Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets, Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems, First- and second-order optimality conditions in optimistic bilevel set-valued programming, First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems, Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation, Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ₁ minimization, Multiunit Facility Location Games, A General Regularized Continuous Formulation for the Maximum Clique Problem, Optimality Conditions for Minimizers at Infinity in Polynomial Programming, A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, An Inverse-Adjusted Best Response Algorithm for Nash Equilibria, MultiComposite Nonconvex Optimization for Training Deep Neural Networks, A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization, A Privacy-Preserving Method to Optimize Distributed Resource Allocation, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization, Adaptive fitness landscape for replicator systems: to maximize or not to maximize, Optimization-Based Calibration of Simulation Input Models, Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality, POD-Based Mixed-Integer Optimal Control of Evolution Systems, S<i>l</i>₁QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems, Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method, Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach, TEMPORAL SHAPING OF SIMULATED TIME SERIES WITH CYCLICAL SAMPLE PATHS, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy, A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences, Allee optimal control of a system in ecology, A sharp augmented Lagrangian-based method in constrained non-convex optimization, Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method, Whitney differentiability of optimal-value functions for bound-constrained convex programming problems, The Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization Problem, On stability of solutions to parametric generalized affine variational inequalities, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, On Regularization and Active-set Methods with Complexity for Constrained Optimization, A Priori Error Estimates for Space-Time Finite Element Discretization of Parabolic Time-Optimal Control Problems, Multi-Instance Dimensionality Reduction via Sparsity and Orthogonality, Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications, Unnamed Item, A projected gradient dynamical system modelling the dynamics of bargaining, Unnamed Item, Taylor Approximation for Chance Constrained Optimization Problems Governed by Partial Differential Equations with High-Dimensional Random Parameters, A unified approach for topology optimization with local stress constraints considering various failure criteria: von Mises, Drucker–Prager, Tresca, Mohr–Coulomb, Bresler– Pister and Willam–Warnke, Locally adaptive activation functions with slope recovery for deep and physics-informed neural networks, Unnamed Item, An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems, Unnamed Item, Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm, Total Variation Regularization Strategies in Full-Waveform Inversion, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, A forward–backward penalty scheme with inertial effects for monotone inclusions. Applications to convex bilevel programming, Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport, First- and Second-Order Methods for Online Convolutional Dictionary Learning, Towards price-based predictive control of a small-scale electricity network, A design technique for fast sampled-data nonlinear model predictive control with convergence and stability results, Nesterov perturbations and projection methods applied to IMRT, A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization, On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods, Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions, Informational Braess’ Paradox: The Effect of Information on Traffic Congestion, Monotonicity of Optimal Contracts Without the First-Order Approach, Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees, MIN-MAX SOLUTIONS FOR PARAMETRIC CONTINUOUS STATIC GAME UNDER ROUGHNESS (PARAMETERS IN THE COST FUNCTION AND FEASIBLE REGION IS A ROUGH SET), Unnamed Item, Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints, Efficient and Convergent Preconditioned ADMM for the Potts Models, Unnamed Item, Unnamed Item, Weak subgradient method for solving nonsmooth nonconvex optimization problems, A WAVELET BASED ALTERNATIVE ITERATION METHOD FOR THE ORIENTATION REFINEMENT OF CRYO-ELECTRON MICROSCOPY 3D RECONSTRUCTION, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections, Unnamed Item, Unnamed Item, Unnamed Item, Initialization and Curing Policies for Pólya Contagion Networks, Data-driven optimal control of switched linear autonomous systems, Control analysis and design via randomised coordinate polynomial minimisation, Dynamic online convex optimization with long-term constraints via virtual queue, Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems, A modulus iteration method for non-negatively constrained TV image restoration, Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints, Optimal control‐decision strategy for wireless networked control systems with structural variation and packet dropout, Linearized Douglas-Rachford method for variational inequalities with Lipschitz mappings, Estimating pollution spread in water networks as a Schrödinger bridge problem with partial information, Sparse Laplacian shrinkage for nonparametric transformation survival model, A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems, Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices, Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum, A dual active set method for \(\ell1\)-regularized problem, Inertial projected gradient method for large-scale topology optimization, A new Lagrangian-based first-order method for nonconvex constrained optimization, Latency vs precision: stability preserving perception scheduling, Optimal decision strategy for discrete-time Markovian jump linear systems, Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem, Duality and sensitivity analysis of multistage linear stochastic programs, A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks, Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations, A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows, A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees, Approximation hierarchies for copositive cone over symmetric cone and their comparison, Haar-like wavelets on hierarchical trees, A neurodynamic algorithm for sparse signal reconstruction with finite-time convergence, Robust self‐triggered control for nonlinear cyber‐physical systems with state constraints under DoS attacks, Shifted inverse power method for computing the smallest M-eigenvalue of a fourth-order partially symmetric tensor, Symbolic homogenization and structure optimization for a periodically perforated cylindrical shell, An integrated design method for active fault diagnosis and control, Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming, A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems, Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming, On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications, A block triangular preconditioner for a class of three-by-three block saddle point problems, Adaptive constraint satisfaction for Markov decision process congestion games: application to transportation networks, Controller design on a new 2DOF PID structure for different processes having integrating nature for both the step and ramp type of signals, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations, A DCA-Newton method for quartic minimization over the sphere, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps, Random Coordinate Descent Methods for Nonseparable Composite Optimization, Chilled sampling for uncertainty quantification: a motivation from a meteorological inverse problem ^*, Mean‐standard deviation model for minimum cost flow problem, Learning shared and non-redundant label-specific features for partial multi-label classification, An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems, Deviance matrix factorization, A study of progressive hedging for stochastic integer programming, Estimates of the size of the domain of the implicit function theorem: a mapping degree-based approach, On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra, Analysis of a variable metric block coordinate method under proximal errors, Reexamining low rank matrix factorization for trace norm regularization, MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS, Digital model of natural cores using geometric design, Non-diagonal critical central sections of the cube, Unnamed Item, Unnamed Item, Sequential profile Lasso for ultra-high-dimensional partially linear models, Neural blind deconvolution with Poisson data, On the Behavior of the Risk of a LASSO-Type Estimator, Active-set algorithm-based statistical inference for shape-restricted generalized additive Cox regression models, A Global Convergence Analysis for Computing a Symmetric Low-Rank Orthogonal Approximation, Randomized Shortest-Path Problems: Two Related Models, Mobile Sensor Routing for Parameter Estimation of Distributed Systems Using the Parallel Tunneling Method, An Extension of the Projected Gradient Method to a Banach Space Setting with Application in Structural Topology Optimization, Interpolation of Functions with Parameter Dependent Jumps by Transformed Snapshots, Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, Bilevel Polynomial Programs and Semidefinite Relaxation Methods, Circumcentric directions of cones, On the effective Putinar's Positivstellensatz and moment approximation, Second-order enhanced optimality conditions and constraint qualifications, Portfolio construction as linearly constrained separable optimization, An accelerated proximal gradient method for multiobjective optimization, A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity, ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization, Convergence analysis of AdaBound with relaxed bound functions for non-convex optimization, Stochastic momentum methods for non-convex learning without bounded assumptions, Generalized Nash equilibrium problem over a fuzzy strategy set, Robust practical output regulation of rational nonlinear systems via numerical approximations to the regulator equations, A Weaker Sufficient Condition for the Chaoticity of Extended Perturbation-Based Updating System for Global Optimization, Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, A limited memory BFGS method for a nonlinear inverse problem in digital breast tomosynthesis, A Multilevel Proximal Gradient Algorithm for a Class of Composite Optimization Problems, Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems, Spike-Based Probabilistic Inference in Analog Graphical Models Using Interspike-Interval Coding, A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions, Foundations of Support Constraint Machines, Support Vector Algorithms for Optimizing the Partial Area under the ROC Curve, Gradient projection methods for the $n$-coupling problem, Continuous adaptive control with zero hysteresis constant and no chatter, Consensus and Information Cascades in Game-Theoretic Imitation Dynamics with Static and Dynamic Network Topologies, Alternating Proximal Regularized Dictionary Learning, Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks, A First Order Method for Solving Convex Bilevel Optimization Problems, A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs, Least squares estimation techniques for position tracking of radioactive sources, Nonlinear optimization and support vector machines, Nonlinear optimization and support vector machines, Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors, Constrained Stress Majorization Using Diagonally Scaled Gradient Projection, Inscribed ball and enclosing box methods for the convex maximization problem, Bounded perturbation resilience of projected scaled gradient methods, Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning, Safe Triplet Screening for Distance Metric Learning, Adaptive sequential machine learning, Risk-Averse Models in Bilevel Stochastic Linear Programming, Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization, Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method, Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm, On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming, Greedy approximate projection for magnetic resonance fingerprinting with partial volumes, Optimization limits in improving system reliability, Abstract convergence theorem for quasi-convex optimization problems with applications, A Computational Framework for Multivariate Convex Regression and Its Variants, BinaryRelax: A Relaxation Approach for Training Deep Neural Networks with Quantized Weights, Solving inverse problems using data-driven models, Duality for Optimization Problems with Infinite Sums, First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants, Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity, On Lipschitz-Like Property for Polyhedral Moving Sets, Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme, Convergence Rate of Incremental Gradient and Incremental Newton Methods, Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP, An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs, A unified neurofuzzy model for classification, Fair resource allocation and stability for communication networks with multipath routing, Computing non-negative tensor factorizations, Approximate Optimal Order Batch Sizes in a Parallel aisle Warehouse, An Accelerated Linearized Alternating Direction Method of Multipliers, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, Kalman-Based Stochastic Gradient Method with Stop Condition and Insensitivity to Conditioning, Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions, A Scaled Gradient Projection Method for Bayesian Learning in Dynamical Systems, A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets, Tractable minor-free generalization of planar zero-field Ising models, A Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems, A Regularized Affine-Scaling Trust-Region Method for Parametric Imaging of Dynamic PET Data, A fast method for simultaneous reconstruction and segmentation in X-ray CT application, Portfolio selection in non-stationary markets, Convergence of quasi-Newton methods for solving constrained generalized equations, Continuum Model and Numerical Method for Dislocation Structure and Energy of Grain Boundaries, B-Subdifferentials of the Projection onto the Generalized Simplex, An AO-ADMM Approach to Constraining PARAFAC2 on All Modes, On Optimality Conditions for Nonlinear Conic Programming, Penalty and Augmented Lagrangian Methods for Constrained DC Programming, Asymptotically Optimal Sequential Design for Rank Aggregation, On the Convergence Rate of Incremental Aggregated Gradient Algorithms, A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization, Nonregular mixed-constrained optimization problems, Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem, On second-order optimality conditions in nonlinear optimization, Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Practical Direct Collocation Methods for Computational Optimal Control, LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums