scientific article

Publication date: 23 March 2006

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

optimality conditions duality convex programming nondifferentiable programming solution algorithms

Convex programming (90C25) Nonlinear programming (90C30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

Optimal Design of Experiments for Implicit Models, The Mordukhovich subdifferentials and directions of descent, Local stability and local convergence of the basic trust-region method, An empirical forecasting method for epidemic outbreaks with application to Covid-19, A Motzkin-Straus type result for 3-uniform hypergraphs, Distributed Continuous-Time Algorithms for Nonsmooth Extended Monotropic Optimization Problems, An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions, Unnamed Item, Toroidal drop under electric field: arbitrary drop-to-ambient fluid viscosity ratio, A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition, Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs, Hybrid differential evolutionary strawberry algorithm for real-parameter optimization problems, Asymptotic Properties of Primal-Dual Algorithm for Distributed Stochastic Optimization over Random Networks with Imperfect Communications, The inverse $q$-numerical range problem and connections to the Davis-Wielandt shell and the pseudospectra of a matrix, Optimization of triangular networks with spatial constraints, Exponential stability of partial primal-dual gradient dynamics with nonsmooth objective functions, Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games, Rate of convergence of the bundle method, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, A male spider's ornamentation polymorphism maintained by opposing selection with two niches, The Burr XII quantile regression for salary-performance models with applications in the sports economy, Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy, SOBMOR: Structured Optimization-Based Model Order Reduction, Adaptive bi-level variable selection for multivariate failure time model with a diverging number of covariates, Smoothing neural network for $L_0$ regularized optimization problem with general convex constraints, A simple version of bundle method with linear programming, An Entropic Method for Discrete Systems with Gibbs Entropy, Collaborative neurodynamic optimization for solving nonlinear equations, Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems, Subdifferential‐based implicit return‐mapping operators in Mohr‐Coulomb plasticity, Subdifferential‐based implicit return‐mapping operators in computational plasticity, Learning-informed parameter identification in nonlinear time-dependent PDEs, Unnamed Item, Optimization with Multivariate Stochastic Dominance Constraints, A version of bundle trust region method with linear programming, Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ₁ minimization, Augmented Lagrangian Methods for Solving Optimization Problems with Stochastic-Order Constraints, Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates, Distributed algorithm for nonsmooth multi-coalition games and its application in electricity markets, Unnamed Item, Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization, Distributed algorithm for social cost minimization with second-order nonlinear dynamics over weight-unbalanced digraphs, Convergence rate estimates for penalty methods revisited, Distributed robust optimization with coupled constraints via Tseng's splitting method, Seeking strategy design for distributed nonsmooth games and its application, Optimal Convergence Rates for the Proximal Bundle Method, Fréchet Second-Order Subdifferentials of Lagrangian Functions and Optimality Conditions, Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming, Sensitivity Analysis in Applications with Deviation, Risk, Regret, and Error Measures, Distance‐targeted competitive follower‐attraction containment control for multi‐agent systems with weighted directed graphs, A CAPM WITH TRADING CONSTRAINTS AND PRICE BUBBLES, Geometry of uncertainty relations for linear combinations of position and momentum, Extreme vortex states and the growth of enstrophy in three-dimensional incompressible flows, Solving dual problems using a coevolutionary optimization algorithm, General Hölder smooth convergence rates follow from specialized rates assuming growth bounds, MM algorithms for geometric and signomial programming, Regularized Decomposition of High-Dimensional Multistage Stochastic Programs with Markov Uncertainty, An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems, Multiple Spectral Kernel Learning and a Gaussian Complexity Computation, Unnamed Item, $ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames, Allee optimal control of a system in ecology, Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies, Bootstrapping least-squares estimates in biochemical reaction networks, Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming, Deterministic Prediction Theory, An extragradient-type method for solving nonmonotone quasi-equilibrium problems, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Outer-approximation algorithms for nonsmooth convex MINLP problems, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, Iteration-complexity of first-order augmented Lagrangian methods for convex programming, Characterization of quadratic growth of extended-real-valued functions, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption, Unnamed Item, Nested coordinate descent algorithms for empirical likelihood, A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization, Distributed optimal load frequency control considering nonsmooth cost functions, Nonsmooth sparsity constrained optimization problems: optimality conditions, Sensitivity analysis of boundary equilibria, Low-Complexity Method for Hybrid MPC with Local Guarantees, Teaching students nonlinear programming with computer algebra system, Center-based l1–clustering method, Unnamed Item, The two-point gradient methods for nonlinear inverse problems based on Bregman projections, A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems, A Dual Method For Evaluation of Dynamic Risk in Diffusion Processes, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes, Pessimistic information gathering, A Selective Linearization Method For Multiblock Convex Optimization, Experiments with a Non-convex Variance-Based Clustering Criterion, An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand, Distance-based beta regression for prediction of mutual funds, Asset price bubbles, market liquidity, and systemic risk, Optimal reduction of solutions for support vector machines, Numerical solution of optimal allocation problems in stratified sampling under box constraints, Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants, Two optimal value functions in parametric conic linear programming, Generalized Nash equilibrium seeking algorithm design for distributed constrained noncooperative games with second-order players, Transient growth in stochastic Burgers flows, Market clearing and price formation, A family of second-order methods for convex $\ell _1$-regularized optimization, Nonconvex bundle method with application to a delamination problem, Nonlinear stochastic programming-with a case study in continuous switching, Primal-dual algorithm for distributed constrained optimization, Quadratic scalarization for decomposed multiobjective optimization, Asset market equilibrium with liquidity risk, Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems, Non-smooth optimization for robust control of infinite-dimensional systems, An algorithm based on semidefinite programming for finding minimax optimal designs, On the convergence of a greedy rank-one update algorithm for a class of linear systems, Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm, Augmented Lagrangian method for probabilistic optimization, Scenario decomposition of risk-averse multistage stochastic programming problems, Optimal reconstruction of material properties in complex multiphysics phenomena, On the existence of competitive equilibrium in frictionless and incomplete stochastic asset markets, Distance majorization and its applications, Adhesive frictionless contact between an elastic isotropic half-space and a rigid axi-symmetric punch, On efficient applications of $G$-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems, A regularized gradient projection method for the minimization problem, Model selection for primal SVM, Distributed gradient algorithm for constrained optimization with application to load sharing in power systems, Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph, Learning in monotone Bayesian games, An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness, A class of shrinking projection extragradient methods for solving non-monotone equilibrium problems in Hilbert spaces, A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery, Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data, Adaptive grid semidefinite programming for finding optimal designs, Regularization methods for optimization problems with probabilistic constraints, Efficient first-order methods for convex minimization: a constructive approach, Emergence of price-taking behavior, Variational method for multiple parameter identification in elliptic PDEs, Augmented Lagrangian optimization under fixed-point arithmetic, Asynchronous distributed voltage control in active distribution networks, Coupled projects, core imputations, and the CAPM, Explicit iteration schemes for minimization problems arising from image denoising, Variant gradient projection methods for the minimization problems, A distributed economic MPC framework for cooperative control under conflicting objectives, On maximum enstrophy growth in a hydrodynamic system, A cutting-plane method to nonsmooth multiobjective optimization problems, A projection neural network for circular cone programming, The complexity results of the sparse optimization problems and reverse convex optimization problems, Optimality conditions based on the Fréchet second-order subdifferential, Two-stage portfolio optimization with higher-order conditional measures of risk, Path following in the exact penalty method of convex programming, An augmented Lagrangian method for distributed optimization, Approximation of solutions to constrained convex minimization problem in Hilbert spaces, Manifold learning with arbitrary norms, Distributed algorithm design for optimal resource allocation problems via incremental passivity theory, Distributed algorithm for robust resource allocation with polyhedral uncertain allocation parameters, On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators, A trust region algorithm with a worst-case iteration complexity of $\mathcal{O}(\epsilon ^{-3/2})$ for nonconvex optimization, Cyclic and simultaneous iterative methods to matrix equations of the form $A_iXB_i=F_i$, The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth, Projected subgradient minimization versus superiorization, Tightness of the maximum likelihood semidefinite relaxation for angular synchronization, A generalized Newton algorithm for quantile regression models, A parallel interior point decomposition algorithm for block angular semidefinite programs, Simple algorithms for optimization on Riemannian manifolds with constraints, Finite element analysis for identifying the reaction coefficient in PDE from boundary observations, An augmented Lagrangian approach for sparse principal component analysis, On optimal reconstruction of constitutive relations, Decomposition methods for dynamic room allocation in hotel revenue management, Selective linearization for multi-block statistical learning, Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization, Extended formulations for radial cones, On the sparsity of Mallows model averaging estimator, Gaining traction: on the convergence of an inner approximation scheme for probability maximization, The penalty functions method and multiplier rules based on the Mordukhovich subdifferential, Image thresholding by variational minimax optimization, Second-order variational analysis in second-order cone programming, New analysis of linear convergence of gradient-type methods via unifying error bound conditions, A linear programming proof of the second order conditions of non-linear programming, Time-consistent approximations of risk-averse multistage stochastic optimization problems, Quadratic growth and critical point stability of semi-algebraic functions, Allocation planning in sales hierarchies with stochastic demand and service-level targets, Optimal allocation of Monte Carlo simulations to multiple hypothesis tests, Optimal experimental design for linear time invariant state-space models, On the optimal design of the randomized unbiased Monte Carlo estimators, Adaptive optimization with periodic dither signals, Augmented Lagrangian method for second-order cone programs under second-order sufficiency, On the optimal generalization error for weighted least squares under variable individual supervision times, Vehicle routing problem with fuzzy time windows, Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations, Outer approximation for mixed-integer nonlinear robust optimization, Scalable distributed least square algorithms for large-scale linear equations via an optimization approach, Nonsmooth bundle trust-region algorithm with applications to robust stability, Second-order optimality conditions for infinite-dimensional quadratic programs, Tree approximation for discrete time stochastic processes: a process distance approach, The stationary point set map in general parametric optimization problems, A decomposition method for large scale MILPs, with performance guarantees and a power system application